Distributed Constraint Satisfaction: Foundations of Cooperation in Multi-agent Systems: Springer Series on Agent Technology
Autor Makoto Yokooen Limba Engleză Paperback – 2 oct 2011
Toate formatele și edițiile | Preț | Express |
---|---|---|
Paperback (1) | 319.40 lei 6-8 săpt. | |
Springer Berlin, Heidelberg – 2 oct 2011 | 319.40 lei 6-8 săpt. | |
Hardback (1) | 325.38 lei 6-8 săpt. | |
Springer Berlin, Heidelberg – 27 noi 2000 | 325.38 lei 6-8 săpt. |
Preț: 319.40 lei
Preț vechi: 399.25 lei
-20% Nou
Puncte Express: 479
Preț estimativ în valută:
61.15€ • 63.56$ • 50.70£
61.15€ • 63.56$ • 50.70£
Carte tipărită la comandă
Livrare economică 05-19 februarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783642640209
ISBN-10: 3642640206
Pagini: 164
Ilustrații: XVII, 143 p.
Dimensiuni: 155 x 235 x 9 mm
Greutate: 0.24 kg
Ediția:Softcover reprint of the original 1st ed. 2001
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Springer Series on Agent Technology
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3642640206
Pagini: 164
Ilustrații: XVII, 143 p.
Dimensiuni: 155 x 235 x 9 mm
Greutate: 0.24 kg
Ediția:Softcover reprint of the original 1st ed. 2001
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Springer Series on Agent Technology
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
1. Constraint Satisfaction Problem.- 1.1 Introduction.- 1.2 Problem Definition.- 1.3 Algorithms for Solving CSPs.- 1.4 Hybrid-Type Algorithm of Backtracking and Iterative Improvement.- 1.5 Analyzing Landscape of CSPs.- 1.6 Partial Constraint Satisfaction Problem.- 1.7 Summary.- 2. Distributed Constraint Satisfaction Problem.- 2.1 Introduction.- 2.2 Problem Formalization.- 2.3 Application Problems.- 2.4 Classification of Algorithms for Solving Distributed CSPs.- 2.5 Summary.- 3. Asynchronous Backtracking.- 3.1 Introduction.- 3.2 Assumptions.- 3.3 Simple Algorithms.- 3.4 Asynchronous Backtracking Algorithm.- 3.5 Evaluations.- 3.6 Summary.- 4. Asynchronous Weak-Commitment Search.- 4.1 Introduction.- 4.2 Basic Ideas.- 4.3 Details of Algorithm.- 4.4 Example of Algorithm Execution.- 4.5 Algorithm Completeness.- 4.6 Evaluations.- 4.7 Summary.- 5. Distributed Breakout.- 5.1 Introduction.- 5.2 Breakout Algorithm.- 5.3 Basic Ideas.- 5.4 Details of Algorithm.- 5.5 Example of Algorithm Execution.- 5.6 Evaluations.- 5.7 Discussions.- 5.8 Summary.- 6. Distributed Consistency Algorithm.- 6.1 Introduction.- 6.2 Overview of Distributed ATMS.- 6.3 Distributed Consistency Algorithm Using Distributed ATMS..- 6.4 Example of Algorithm Execution.- 6.5 Evaluations.- 6.6 Summary.- 7. Handling Multiple Local Variables.- 7.1 Introduction.- 7.2 Agent-Prioritization Approach.- 7.3 Asynchronous Weak-Commitment Search with Multiple Local Variables.- 7.4 Evaluations.- 7.5 Summary.- 8. Handling Over-Constrained Situations.- 8.1 Introduction.- 8.2 Problem Formalization.- 8.3 Distributed Maximal CSPs.- 8.4 Distributed Hierarchical CSPs.- 8.5 Summary.- 9. Summary and Future Issues.
Caracteristici
The book adapts results from classical constraint satisfaction for multi-agent systems and consolidates recent research and presents new results in a consistent way Includes supplementary material: sn.pub/extras