3415 search results - page 425 / 683 » Lower bounds on kernelization |
169
click to vote
AAAI
2010
15 years 8 months ago
2010
Modern complete SAT solvers almost uniformly implement variations of the clause learning framework introduced by Grasp and Chaff. The success of these solvers has been theoretical...
175
click to vote
ADHOCNOW
2010
Springer
15 years 8 months ago
2010
Springer
We consider the problem of efficient alarm protocol for ad-hoc radio networks consisting of devices that try to gain access for transmission through a shared radio communication ch...
183
click to vote
APVIS
2007
15 years 8 months ago
2007
A straight-line grid drawing of a planar graph G is a drawing of G on an integer grid such that each vertex is drawn as a grid point and each edge is drawn as a straight-line segm...
140
click to vote
DAGSTUHL
2007
15 years 8 months ago
2007
We consider the problems of set partitioning into k clusters with minimum total cost and minimum of the maximum cost of a cluster. The cost function is given by an oracle, and we ...
148
click to vote
DLT
2008
15 years 8 months ago
2008
We consider multi-pushdown automata, a multi-stack extension of pushdown automata that comes with a constraint on stack operations: a pop can only be performed on the first non-emp...