566 search results - page 28 / 114 » Solution Reuse in Dynamic Constraint Satisfaction Problems |
69
Voted
CP
2007
Springer
15 years 6 months ago
2007
Springer
In this paper we present new techniques for improving backtracking based Quantified Constraint Satisfaction Problem (QCSP) solvers. QCSP is a generalization of CSP in which variab...
ICTAI
2006
IEEE
15 years 6 months ago
2006
IEEE
Traditional global search heuristics to solve constraint satisfaction problems focus on properties of an individual variable that mandate early search attention. If, however, one ...
104
Voted
AAAI
2000
15 years 1 months ago
2000
Many problem-solving tasks can be formalized as constraint satisfaction problems (CSPs). In a multi-agent setting, information about constraints and variables may belong to differ...
98
Voted
CP
2004
Springer
15 years 5 months ago
2004
Springer
Constraint programming is rapidly becoming the technology of choice for modeling and solving complex combinatorial problems. However, users of constraint programming technology nee...
107
click to vote
AAAI
1997
15 years 1 months ago
1997
The use of heuristics as a means to improve constraint solver performance has been researched widely. However, most work has been on problem-independentheuristics (e.g., variable ...