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...
Call Number: | Libro Electrónico |
---|---|
Main Author: | |
Format: | Electronic eBook |
Language: | Inglés |
Published: |
London : Hoboken :
ISTE ; Wiley,
2013.
|
Series: | FOCUS Series.
|
Subjects: | |
Online Access: | Texto completo |