68 search results - page 3 / 14 » The Effect of Nogood Learning in Distributed Constraint Sati... |
FLAIRS
2007
14 years 3 days ago
2007
Using information from failures to guide subsequent search is an important technique for solving combinatorial problems in domains such as boolean satisfiability (SAT) and constr...
CP
2006
Springer
14 years 1 months ago
2006
Springer
The paper presents a method for generating solutions of a constraint satisfaction problem (CSP) uniformly at random. The main idea is to express the CSP as a factored probability d...
AIMSA
2008
Springer
13 years 11 months ago
2008
Springer
We present a hybrid approach to Distributed Constraint Satisfaction which combines incomplete, fast, penalty-based local search with complete, slower systematic search. Thus, we pr...
CP
2008
Springer
13 years 11 months ago
2008
Springer
ABT is the reference algorithm for asynchronous distributed constraint satisfaction. When searching, ABT produces nogoods as justifications of deleted values. When one of such nogo...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
DCSP (Distributed Constraint Satisfaction Problem) has been a very important research area in AI (Artificial Intelligence). There are many application problems in distributed AI t...