Hybrid algorithms for distributed constraint satisfaction
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 local problem together with the constraints relatin...
| Main Author: | |
|---|---|
| Other Authors: | |
| Published: |
Robert Gordon University
2010
|
| Subjects: | |
| Online Access: | http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.519364 |