73 search results - page 4 / 15 » A Landscape Analysis of Constraint Satisfaction Problems |
CP
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. Researchers have focused on assessing the quality of search algorithms by measuring effort, number of mistakes, runtime distributions and other characteristics. In this p...
ECAI
1994
Springer
15 years 1 months ago
1994
Springer
We introduce the multiple capacitated job shop scheduling problem as a generalization of the job shop scheduling problem. In this problem machines may process several operations s...
GECCO
2007
Springer
15 years 4 months ago
2007
Springer
Forma analysis provides an approach to formally derive domain specific operators based on domain-independent operator templates by manipulating a set of equivalence relations (i....
ESA
2006
Springer
15 years 1 months ago
2006
Springer
The class Max (r, 2)-CSP consists of constraint satisfaction problems with at most two r-valued variables per clause. For instances with n variables and m binary clauses, we presen...
SGAI
2007
Springer
15 years 3 months ago
2007
Springer
Constraint Satisfaction Problems can be solved using either iterative improvement or constructive search approaches. Iterative improvement techniques converge quicker than the cons...