344 search results - page 32 / 69 » The Santa Claus problem |
MSV
2004
13 years 11 months ago
2004
A large number of applications can be represented by quantified Boolean formulas (QBF). Although evaluating QBF is NP-hard and thus very difficult, there has been significant progr...
CEC
2009
IEEE
14 years 1 months ago
2009
IEEE
Evolutionary algorithms have employed the SAW (Stepwise Adaptation of Weights) method in order to solve CSPs (Constraint Satisfaction Problems). This method originated in hill-clim...
ECAI
2006
Springer
14 years 1 months ago
2006
Springer
Abstract. We address the problem of representing big sets of binary constraints compactly. Binary constraints in the form of 2literal clauses are ubiquitous in propositional formul...
IJCAI
1989
13 years 11 months ago
1989
A new formalism for building network models in Prolog is proposed. It is based on a new semantic interpretation of the Prolog variables and clauses, which are used to represent th...
CP
2000
Springer
14 years 1 months ago
2000
Springer
The ability to reduce either the number of variables or clauses in instances of the Satisfiability problem (SAT) impacts the expected computational effort of solving a given instan...