140 search results - page 5 / 28 » Rewriting Numeric Constraint Satisfaction Problems for Consi... |
SAC
2010
ACM
15 years 4 months ago
2010
ACM
In this paper, we propose a new algorithm for enforcing relational consistency on every set of k constraints of a finite Constraint Satisfaction Problem (CSP). This algorithm ope...
IJCAI
1997
14 years 11 months ago
1997
We consider algorithms of the Waltz type for computing local consistency (also called arcconsistency) for constraints over numeric domains. Many commonlyused propagationrules do n...
IJCAI
2003
14 years 11 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...
IJCAI
1989
14 years 10 months ago
1989
We describe a general technique for expressing domain knowledge in constraint satisfaction problems, and using it to develop optimized parallel arc consistency algorithms for the ...
124
click to vote
PROCEDIA
2011
14 years 12 days 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...