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 |