Skip to product information
Algorithms and Ordering Heuristics for Distributed Constraint Satisfaction Problems

Algorithms and Ordering Heuristics for Distributed Constraint Satisfaction Problems

Sale price  $160.16 Regular price  $177.95

Reliable shipping

Flexible returns

Algorithms and Ordering Heuristics for Distributed Constraint Satisfaction Problems

Mohamed Wahbi

Computers / Programming / Algorithms

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. This distribution is mainly due to privacy and/or security requirements. Therefore, a distributed model allowing a decentralized solving process is more adequate to model and solve such kinds of problem. The distributed constraint satisfaction problem has such properties.

Mohamed Wahbi is currently an associate lecturer at Ecole des Mines de Nantes in France. He received his PhD degree in Computer Science from University Montpellier 2, France and Mohammed V University-Agdal, Moracco in 2012 and his research focused on distributed Constraint Reasoning.

Publication Date: 10 July 2013
Publisher: Wiley
Imprint: Wiley-ISTE
ISBN-13: 9781848215948
Format: Hardback
Page Count: 176
Weight (oz): 15.78

You may also like