Hybrid algorithms for distributed constraint satisfaction.
(2010)
Thesis
LEE, D.A.J. 2010. Hybrid algorithms for distributed constraint satisfaction.. Robert Gordon University, PhD thesis.
A Distributed Constraint Satisfaction Problem (DisCSP) is a CSP which is divided into several inter-related complex local problems, each assigned to a different agent. Thus, each agent has knowledge of the variables and corresponding domains of its l... Read More about Hybrid algorithms for distributed constraint satisfaction..