344 search results - page 5 / 69 » The Santa Claus problem |
ESOP
2008
Springer
13 years 10 months ago
2008
Springer
Abstract. We present a generic algorithm for solving Horn clauses through iterative specialisation. The algorithm is generic in the sense that it can be instantiated with any decid...
CONSTRAINTS
2007
13 years 8 months ago
2007
SAT is probably one of the most-studied constraint satisfaction problems. In this paper, a new hybrid technique based on local search is introduced in order to approximate and ext...
ECAI
1994
Springer
14 years 20 days ago
1994
Springer
We describe a detailed experimental investigation of the phase transition for several different classes of randomly generated satisfiability problems. We observe a remarkable consi...
ORL
2008
13 years 8 months ago
2008
We define a generalized variant of the satisfiability problem (SAT) where each "clause" is an or-list of inequalities in n variables. The inequality satisfiability probl...
ICTAI
2008
IEEE
14 years 3 months ago
2008
IEEE
These last years, the issue of locating and explaining contradictions inside sets of propositional clauses has received a renewed attention due to the emergence of very efficient...