986 search results - page 87 / 198 » Algorithmic Lower Bounds for Problems Parameterized by Cliqu... |
128
Voted
COMBINATORICS
2004
15 years 3 months ago
2004
In this paper we bring together the areas of combinatorics and propositional satisfiability. Many combinatorial theorems establish, often constructively, the existence of positive...
112
click to vote
COCO
2009
Springer
15 years 10 months ago
2009
Springer
Devising an efficient deterministic – or even a nondeterministic sub-exponential time – algorithm for testing polynomial identities is a fundamental problem in algebraic comp...
170
Voted
AAAI
2008
15 years 6 months ago
2008
When controlling dynamic systems, such as mobile robots in uncertain environments, there is a trade off between risk and reward. For example, a race car can turn a corner faster b...
114
Voted
JMIV
2006
15 years 3 months ago
2006
We address the problem of reconstructing a planar shape from a finite number of noisy measurements of its support function or its diameter function. New linear and non-linear algor...
132
Voted
ICRA
2007
IEEE
15 years 10 months ago
2007
IEEE
— We explore an on-line problem where a group of robots has to reach a target whose position is known in an unknown planar environment whose geometry is acquired by the robots du...