344 search results - page 8 / 69 » The Santa Claus problem |
IJCAI
2003
13 years 10 months ago
2003
Efficient implementations of DPLL with the addition of clause learning are the fastest complete satisfiability solvers and can handle many significant real-world problems, such as...
JMLR
2010
13 years 3 months ago
2010
Identifying a subset of features that preserves classification accuracy is a problem of growing importance, because of the increasing size and dimensionality of real-world data se...
SAT
2004
Springer
14 years 1 months ago
2004
Springer
The Walksat local search algorithm has previously been extended to handle quantification over variables. This greatly reduces model sizes, but in order to guide greedy moves the a...
SAT
2004
Springer
14 years 1 months ago
2004
Springer
The Boolean circuits is well established as a data structure for building propositional encodings of problems in preparation for satisfiability solving. The standard method for co...
CADE
2009
Springer
14 years 9 months ago
2009
Springer
This paper is concerned with the problem of checking whether a given subset of an unsatisfiable Boolean CNF formula takes part in the basic causes of the inconsistency of . More ...