566 search results - page 12 / 114 » Solution Reuse in Dynamic Constraint Satisfaction Problems |
149
Voted
PROCEDIA
2011
14 years 3 months ago
2011
We report the first evaluation of Constraint Satisfaction as a computational framework for solving closest string problems. We show that careful consideration of symbol occurrenc...
AAAI
1998
15 years 1 months ago
1998
It is well known that any non-binary discrete constraint satisfaction problem (CSP) can be translated into an equivalent binary CSP. Two translations are known: the dual graph tra...
AAAI
1994
15 years 1 months ago
1994
The paper evaluates the eectiveness of learning for speeding up the solution of constraint satisfaction problems. It extends previous work (Dechter 1990) by introducing a new and ...
90
Voted
ICTAI
2008
IEEE
15 years 6 months ago
2008
IEEE
Constraint programming has been used in many applications where uncertainty arises to model safe reasoning. The goal of constraint propagation is to propagate intervals of uncerta...
102
Voted
CP
2005
Springer
15 years 5 months ago
2005
Springer
When the search for a solution to a constraint satisfaction problem backtracks, it is not usually worthwhile to remember the assignment that failed, because the same assignment wil...