Sciweavers

1169 search results - page 97 / 234
» Degrees of monotone complexity
Sort
View
97
Voted
LPNMR
1997
Springer
15 years 5 months ago
Power Defaults
This paper introduces power default reasoning (PDR), a framework for nonmonotonic reasoning based on the domain-theoretic idea of modeling default rules with partial-information i...
Guo-Qiang Zhang, William C. Rounds
125
Voted
AMC
2010
175views more  AMC 2010»
15 years 29 days ago
An inexact parallel splitting augmented Lagrangian method for large system of linear equations
: Parallel iterative methods are powerful tool for solving large system of linear equations (LEs). The existing parallel computing research results are focussed mainly on sparse sy...
Zheng Peng, DongHua Wu
CORR
2008
Springer
154views Education» more  CORR 2008»
15 years 27 days ago
Sponsored Search Auctions with Markovian Users
Abstract. Sponsored search involves running an auction among advertisers who bid in order to have their ad shown next to search results for specific keywords. The most popular auct...
Gagan Aggarwal, Jon Feldman, S. Muthukrishnan, Mar...
ECCC
2006
145views more  ECCC 2006»
15 years 25 days ago
Constraint satisfaction: a personal perspective
Attempts at classifying computational problems as polynomial time solvable, NP-complete, or belonging to a higher level in the polynomial hierarchy, face the difficulty of undecid...
Tomás Feder
110
Voted
IJAC
2006
93views more  IJAC 2006»
15 years 25 days ago
On Word Reversing in Braid Groups
It has been conjectured that in a braid group, or more generally in a Garside group, applying any sequence of monotone equivalences and word reversings can increase the length of a...
Patrick Dehornoy, Bert Wiest