Algorithms and ordering heuristics for distributed constraint satisfaction problems:
Saved in:
Bibliographic Details
Main Author: Wahbi, Mohamed (Author)
Format: Electronic eBook
Language:English
Published: London ISTE 2013
Series:FOCUS Series
Subjects:
Online Access:FRO01
UBG01
Volltext
Item Description: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
Physical Description:1 Online-Ressource (xvi, 157 pages)
ISBN:9781118753422
1118753429
9781118753620
1118753623
9781118753521
1118753526
9781848215948

There is no print copy available.

Interlibrary loan Place Request Caution: Not in THWS collection! Get full text