Algorithms and ordering heuristics for distributed constraint satisfaction problems /
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...
| Κύριος συγγραφέας: | |
|---|---|
| Μορφή: | Ηλ. βιβλίο |
| Γλώσσα: | English |
| Έκδοση: |
London :
ISTE ;
2013.
Hoboken : Wiley, 2013. |
| Σειρά: | FOCUS Series.
|
| Θέματα: | |
| Διαθέσιμο Online: | Full Text via HEAL-Link |
| Περίληψη: | 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. |
|---|---|
| Περιγραφή τεκμηρίου: | 7.5.1. Uniform binary random DisCSPs. |
| Φυσική περιγραφή: | 1 online resource (xvi, 157 pages). |
| Βιβλιογραφία: | Includes bibliographical references and index. |
| ISBN: | 9781118753422 1118753429 9781118753620 1118753623 9781118753521 1118753526 1848215940 9781848215948 |
| DOI: | 10.1002/9781118753620 |
