2446 search results - page 141 / 490 » Choiceless Polynomial Time |
86
Voted
CADE
2001
Springer
16 years 1 months ago
2001
Springer
A boolean formula in conjunctive normal form (CNF) F is refuted by literal?once resolution if the empty clause is inferred from F by resolving on each literal of F at most once. Li...
79
Voted
ICS
2010
Tsinghua U.
15 years 10 months ago
2010
Tsinghua U.
We introduce the notion of a stable instance for a discrete optimization problem, and argue that in many practical situations only sufficiently stable instances are of interest. T...
104
Voted
LICS
2009
IEEE
15 years 7 months ago
2009
IEEE
In a constraint satisfaction problem (CSP) the goal is to find an assignment of a given set of variables subject to specified constraints. A global cardinality constraint is an ...
102
click to vote
CONCUR
2009
Springer
15 years 7 months ago
2009
Springer
In this paper, we extend the classical notion of strategies in turn-based finite games by allowing several moves to be selected. We define and study a quantitative measure for pe...
87
Voted
ICRA
2008
IEEE
15 years 7 months ago
2008
IEEE
Abstract— We study optimal trajectory generation for nonholonomic mobile robots in the presence of moving obstacles. The trajectory is presented by a parameterized higher-order p...