Title Statements
- Full title :Algorithms and ordering heuristics for distributed constraint satisfaction problems / Mohamed Wahbi.
Summary
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.
Read More ↓Edition Statements
- Publication Date:2013.
Publication Statements
- Publisher(s):ISTE
- Place of Publication:London
- Language:eng
- Publication Date:2013.
Notes
7.5.1. Uniform binary random DisCSPs. - Includes bibliographical references and index. - Print version record.
The Physical Object
- Description:Online Ressource (xvi, 157 Seiten)
Edition Identifiers
- ISBN:9781118753422, 1118753429, 9781118753620, 1118753623, 9781118753521, 1118753526, 1848215940, 9781848215948
- oclc:on1039160271
- LC Classification:TA1637
- Dewey Decimal:621.36
Subjects
Writers
More from this Series
No reviews yet. Be the first to rate this work.
Files & Downloads
-
Algorithms and Ordering Heuristics for Distribute…
PDF · 2.8 MB · updated -
Algorithms and Ordering Heuristics for Distribute…
PDF · 5.0 MB · updated
Rate & Review