27 search results - page 1 / 6 » Improving Repair-Based Constraint Satisfaction Methods by Va... |
AAAI
1994
13 years 5 months ago
1994
A constraint satisfaction problem (CSP) is a problem to find an assignment that satisfies given constraints. An interesting approach to CSP is a repair-based method that first gen...
CONSTRAINTS
2006
13 years 4 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...
AAAI
1996
13 years 5 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...
CADE
2000
Springer
13 years 8 months ago
2000
Springer
Abstract. This article introduces two techniques to improve the propagation efficiency of CSP based finite model generation methods. One approach consists in statically rewriting ...
ACG
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. Kakuro consists in filling a grid with integers that sum up to predefined values. Sums are predefined for each row and column and all integers have to be different in ...