102 search results - page 6 / 21 » Hyper-heuristics for the dynamic variable ordering in constr... |
SARA
2007
Springer
14 years 1 months ago
2007
Springer
Constraint Programming is a powerful approach for modeling and solving many combinatorial problems, scalability, however, remains an issue in . Abstraction and reformulation techni...
AAAI
1996
13 years 8 months ago
1996
Two methods are described for enhancing performance of branch and bound methods for overconstrained CSPS. These methods improve either the upper or lower bound, respectively, duri...
CP
2006
Springer
13 years 11 months ago
2006
Springer
We reconsider the idea of structural symmetry breaking (SSB) for constraint satisfaction problems (CSPs). We show that the dynamic dominance checks used in symmetry breaking by dom...
CONSTRAINTS
2006
13 years 7 months ago
2006
Constraint satisfaction problems (CSPs) sometimes contain both variable symmetries and value symmetries, causing adverse effects on CSP solvers based on tree search. As a remedy, s...
CEC
2009
IEEE
13 years 11 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...