Algorithms and ordering heuristics for distributed constraint satisfaction problems - Wahbi, Mohamed (ISTE, 2013)
7.5.1. Uniform binary random DisCSPs
DisCSP (Distributed Constraint Satisfaction Problem) is a general framework for solving distributed problems arising in Distributed Artificial Intelligence. A wide variety of problems in artificial intelligence are solved using the constraint satisfaction problem paradigm. However, there are several applications in multi-agent coordination that are of a distributed nature. In this type of application, the knowledge about the problem, that is, variables and constraints, may be logically or geographically distributed among physical distributed agents
Includes bibliographical references and index