Algorithms and Ordering Heuristics for Distributed Constraint Satisfaction Problems

by Mohamed Wahbi

★★★★☆
4.1 (510)

US$80.08

15% OFF CODE: SAVE15

Description

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 geogra

Explore Related Tags