344 search results - page 6 / 69 » The Santa Claus problem |
SAT
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. We present a new generic problem solving approach for overconstrained problems based on Max-SAT. We first define a clausal form formalism that deals with blocks of clau...
GECCO
2004
Springer
14 years 1 months ago
2004
Springer
This paper presents an investigation of genetic programming fitness landscapes. We propose a new indicator of problem hardness for tree-based genetic programming, called negative ...
QEST
2008
IEEE
14 years 2 months ago
2008
IEEE
Magnifying Lens Abstraction in Markov Decision Processes ∗ Pritam Roy1 David Parker2 Gethin Norman2 Luca de Alfaro1 Computer Engineering Dept, UC Santa Cruz, Santa Cruz, CA, USA ...
AAAI
2008
13 years 11 months ago
2008
Currently, the most effective complete SAT solvers are based on the DPLL algorithm augmented by clause learning. These solvers can handle many real-world problems from application...
CPAIOR
2010
Springer
13 years 6 months ago
2010
Springer
Finite domain propagation solving, the basis of constraint programming (CP) solvers, allows building very high-level models of problems, and using highly specific inference encapsu...