16404 search results - page 2545 / 3281 » A set coverage problem |
204
click to vote
COCOON
2007
Springer
16 years 1 months ago
2007
Springer
The regularity lemma of Szemer´edi gives a concise approximate description of a graph via a so called regular-partition of its vertex set. In this paper we address the following ...
198
click to vote
CP
2007
Springer
16 years 1 months ago
2007
Springer
Motivated by the performance improvements made to SAT solvers in recent years, a number of different encodings of constraints into SAT have been proposed. Concrete examples are th...
186
click to vote
CP
2007
Springer
16 years 1 months ago
2007
Springer
: This report introduces a geometrical constraint kernel for handling the location in space and time of polymorphic k-dimensional objects subject to various geometrical and time co...
174
click to vote
CP
2007
Springer
16 years 1 months ago
2007
Springer
We present an algorithm for compressing table constraints representing allowed or disallowed tuples. This type of constraint is used for example in configuration problems, where t...
199
click to vote
CSL
2007
Springer
16 years 1 months ago
2007
Springer
We consider the problem of automating and checking the use of previously proved lemmas in the proof of some main theorem. In particular, we call the collection of such previously p...