Algorithms and Ordering Heuristics for Distributed Constraint Satisfaction Problems

Algorithms and Ordering Heuristics for Distributed Constraint Satisfaction Problems

by Mohamed Wahbi
     
 

View All Available Formats & Editions

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

See more details below

Overview

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 of the problem, i.e. 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.

Product Details

ISBN-13:
9781848215948
Publisher:
Wiley
Publication date:
06/17/2013
Series:
FOCUS Series
Pages:
176
Product dimensions:
6.00(w) x 9.30(h) x 0.80(d)

Read an Excerpt

Click to read or download

Customer Reviews

Average Review:

Write a Review

and post it to your social network

     

Most Helpful Customer Reviews

See all customer reviews >