Sciweavers

1523 search results - page 94 / 305
» Partially ordered secretaries
Sort
View
79
Voted
SODA
2010
ACM
155views Algorithms» more  SODA 2010»
15 years 10 months ago
A Space--Time Tradeoff for Permutation Problems
Many combinatorial problems--such as the traveling salesman, feedback arcset, cutwidth, and treewidth problem-can be formulated as finding a feasible permutation of n elements. Ty...
Mikko Koivisto, Pekka Parviainen
120
Voted
NIL
1991
15 years 4 months ago
Deduction with Supernormal Defaults
In this paper we consider supernormal defaults [Poo88] with a strict partial order defining their priorities [Bre91]. We investigate their relation to minimal or preferential ent...
Stefan Brass
AIPS
2000
15 years 2 months ago
New Results about LCGP, a Least Committed GraphPlan
Planners from the family of Graphplan (Graphplan, IPP, STAN...) are presently considered as the most efficient ones on numerous planning domains. Their partially ordered plans can...
Michel Cayrol, Pierre Régnier, Vincent Vida...
128
Voted
JCSS
2010
112views more  JCSS 2010»
14 years 11 months ago
Towards a dichotomy for the Possible Winner problem in elections based on scoring rules
To make a joint decision, agents (or voters) are often required to provide their preferences as linear orders. To determine a winner, the given linear orders can be aggregated acc...
Nadja Betzler, Britta Dorn
PODS
2005
ACM
130views Database» more  PODS 2005»
16 years 25 days ago
Differential constraints
Direct reductions of partial differential equations to systems of ordinary differential equations are in one-to-one correspondence with compatible differential constraints. The dif...
Bassem Sayrafi, Dirk Van Gucht