344 search results - page 20 / 69 » The Santa Claus problem |
FOCS
1999
IEEE
14 years 2 months ago
1999
IEEE
We present a simple probabilistic algorithm for solving kSAT, and more generally, for solving constraint satisfaction problems (CSP). The algorithm follows a simple localsearch pa...
ICALT
2006
IEEE
14 years 3 months ago
2006
IEEE
The teaching/ learning of cognitive skills, such as problem-solving, is an important goal in most forms of education. In well-structured subject areas certain exercise problem typ...
FUIN
2010
13 years 7 months ago
2010
Abstract. Developing a good formalism and an efficient decision procedure for the instance checking problem is desirable for practical application of description logics. The data c...
JSAT
2006
13 years 9 months ago
2006
An independent set of variables is one in which no two variables occur in the same clause in a given k-SAT instance. Recently, independent sets have obtained more attention. Due t...
CP
2005
Springer
14 years 3 months ago
2005
Springer
We consider the problem of encoding Boolean cardinality constraints in conjunctive normal form (CNF). Boolean cardinality constraints are formulae expressing that at most (resp. at...