344 search results - page 28 / 69 » The Santa Claus problem |
CADE
2006
Springer
14 years 10 months ago
2006
Springer
This paper presents new classes of tree automata combining automata with equality test and automata modulo equational theories. We believe that these classes have a good potential ...
DOOD
1991
Springer
14 years 1 months ago
1991
Springer
This paper examines the problem of adding non-deterministic constructs to a declarative database language based on Horn Clause Logic. We revise a previously proposed approach, the...
IJCNN
2007
IEEE
14 years 4 months ago
2007
IEEE
— Solvers for the Boolean satisfiability problem are an important base technology for many applications. The most efficient SAT solvers for industrial applications are based on...
FMCAD
2004
Springer
14 years 3 months ago
2004
Springer
We present a new and very simple translation of the bounded model checking problem which is linear both in the size of the formula and the length of the bound. The resulting CNF-fo...
JAL
2000
13 years 9 months ago
2000
The (unweighted) Maximum Satisfiability problem (MaxSat) is: given a boolean formula in conjunctive normal form, find a truth assignment that satisfies the most number of clauses....