566 search results - page 14 / 114 » Solution Reuse in Dynamic Constraint Satisfaction Problems |
114
click to vote
AAAI
1996
15 years 1 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...
150
click to vote
IJCAI
1989
15 years 1 months ago
1989
This paper describes the design and implementation of a constraint satisfaction system that uses delayed evaluation techniques to provide greater representational power and to avo...
87
Voted
CPAIOR
2004
Springer
15 years 5 months ago
2004
Springer
To improve solution robustness, we introduce the concept of super solutions to constraint programming. An (a, b)-super solution is one in which if a variables lose their values, th...
103
Voted
IJCAI
2003
15 years 1 months ago
2003
We present an algorithm Pref-AC that limits arc consistency (AC) to the preferred choices of a tree search procedure and that makes constraint solving more efficient without chan...
120
click to vote
ICDCS
2000
IEEE
15 years 4 months ago
2000
IEEE
We present resolvent-based learning as a new nogood learning method for a distributed constraint satisfaction algorithm. This method is based on a look-back technique in constrain...