400 search results - page 9 / 80 » A Synthesis of Constraint Satisfaction and Constraint Solvin... |
CP
2001
Springer
14 years 4 days ago
2001
Springer
Abstract. Although constraint programming offers a wealth of strong, generalpurpose methods, in practice a complex, real application demands a person who selects, combines, and ref...
SAGA
2001
Springer
14 years 2 days ago
2001
Springer
We propose a generic, domain-independent local search method called adaptive search for solving Constraint Satisfaction Problems (CSP). We design a new heuristics that takes advan...
AAAI
1996
13 years 9 months ago
1996
A team of constraint agents with diverse viewpoints canfind a solution to a constraint satisfaction problem (CSP) whenthe individual agents have an incomplete viewof the problem.I...
AAAI
1997
13 years 9 months ago
1997
We report on the performance of an enhanced version of the “Davis-Putnam” (DP) proof procedure for propositional satisfiability (SAT) on large instances derived from realworld...
ICDCS
2000
IEEE
14 years 1 days 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...