566 search results - page 59 / 114 » Solution Reuse in Dynamic Constraint Satisfaction Problems |
122
click to vote
CPAIOR
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. An optimization problem arising in the design of optical fibre networks is discussed. A network contains client nodes, each installed on one or more SONET rings. A const...
140
click to vote
CP
2004
Springer
15 years 7 months ago
2004
Springer
A distributed concurrent search algorithm for distributed constraint satisfaction problems (DisCSPs) is presented. Concurrent search algorithms are composed of multiple search proc...
134
click to vote
CP
1995
Springer
15 years 7 months ago
1995
Springer
Abstract. We investigate the dynamic variable ordering (DVO) technique commonly used in conjunction with tree-search algorithms for solving constraint satisfaction problems. We fi...
199
click to vote
CPAIOR
2010
Springer
15 years 2 months ago
2010
Springer
Finite domain propagation solving, the basis of constraint programming (CP) solvers, allows building very high-level models of problems, and using highly specific inference encapsu...
143
click to vote
CP
2006
Springer
15 years 7 months ago
2006
Springer
Dynamic Backtracking (DBT) is a well known algorithm for solving Constraint Satisfaction Problems. In DBT, variables are allowed to keep their assignment during backjump, if they a...