Algorithms and ordering heuristics for distributed constraint satisfaction problems /

Mostrar otras versiones (1)

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...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor principal: Wahbi, Mohamed
Formato: Electrónico eBook
Idioma:Inglés
Publicado: London : Hoboken : ISTE ; Wiley, 2013.
Colección:FOCUS Series.
Temas:
Computer algorithms.
Image processing > Digital techniques.
Neural computers.
Algorithms
Algorithmes.
Traitement d'images > Techniques numériques.
Ordinateurs neuronaux.
algorithms.
digital imaging.
TECHNOLOGY & ENGINEERING > Optics.
Computer algorithms
Image processing > Digital techniques
Neural computers
Multi-User.
Acceso en línea:Texto completo
Descripción
Sumario: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.
Notas:7.5.1. Uniform binary random DisCSPs.
Descripción Física:1 online resource (xvi, 157 pages)
Bibliografía:Includes bibliographical references and index.
ISBN:9781118753422
1118753429
9781118753620
1118753623
9781118753521
1118753526
1848215940
9781848215948

Ejemplares similares