Distributed search by constrained agents : algorithms, performance, communication
Author(s)
Bibliographic Information
Distributed search by constrained agents : algorithms, performance, communication
（Advanced information and knowledge processing）
Springer, c2008
Available at / 1 libraries
-
No Libraries matched.
- Remove all filters.
Note
Includes bibliographical references (p. [209]-213) and index
Description and Table of Contents
Description
The well defined model of distributed constraints satisfaction and optimization (DisCSPs/DisCOPs) can serve as the basis for the design and investigation of distributed search algorithms, of protocols and of negotiations and search. This book presents a comprehensive discussion on the field of distributed constraints, its algorithms and its active research areas. The book introduces distributed constraint satisfaction and optimization problems and describes the underlying model.
Table of Contents
Constraints Satisfaction Problems - CSPs.- Constraints Optimization Problems - COPs.- Distributed Search.- Asynchronous Backtracking (ABT).- Asynchronous Forward-Checking.- Concurrent Dynamic Backtracking.- Distributed Ordering Heuristics.- Asynchronous Ordering Heuristics.- Performance measures for distributed search.- Experimental Evaluation of DisCSP Algorithms.- The Impact of Communication - Message Delays.- Message Delays and DisCSP Search Algorithms.- Distributed Constraint Optimization Problems (DisCOPs).- Asynchronous Optimization for DisCOPs.- Asynchronous Forward-Bounding.- Extending AFB - BackJumping.- Empirical Evaluation of DisCOP algorithms.
by "Nielsen BookData"
