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.
Distributed Search by Constrained Agents
and over one million other books are available for Amazon Kindle.
Learn more
FREE Two-Day Shipping for Students. Learn more |
| ||||||||||||||||||||||||
Book Description
Special Offers and Product Promotions
- Buy $50 in qualifying physical textbooks, get $5 in Amazon MP3 Credit. Here's how (restrictions apply)
Editorial Reviews
From the Back Cover
Agent technology is evolving as a leading field of research connected to diverse areas such as A.I., E-commerce, robotics and information retrieval. Agents systems use reasoning and constraint-based reasoning that has a wide potential for representing multiple types of problems. A fundamental building block within all these areas is the ability to perform search and an inherent part of all agents must therefore relate to distributed and cooperative methods of search. This book presents a comprehensive discussion on the field of distributed constraints, its algorithms and its active research areas. It introduces distributed constraint satisfaction and optimization problems and proceeds to present a complete state-of-the-art in DisCSP & DisCOP research. The presentation assumes no prior knowledge of constraints or distributed constraints. Features and topics: • Introduces in great detail search algorithms for DisCSPs and DisCOPs • Presents a comprehensive study of distributed performance measures for all algorithms, allowing an extensive experimental evaluation to be constructed • Addresses potential problems following current research on DisCSPs and DisCOPs • Discusses the impact of communication quality on distributed search (for example message delays) • Describes the most significant recent research in the field of distributed constraints satisfaction and optimization, including its difficulties This exposition of the many elements of distributed search algorithms for DisCSPs and DisCOPs will be a research asset and an invaluable read for researchers and graduate students who focus on distributed CSPs and COPs. In addition, the book’s comprehensiveness and style make it an ideal tool for a graduate course on distributed search in AI. Professor Amnon Meisels has an active research group who have worked in distributed constraints for a number of years and has published extensively in the field. He is a member of the Department of Computer Science at Ben-Gurion University, Beer-Sheva, Israel.
Product Details
Would you like to update product info or give feedback on images?
|
More About the Author
Discover books, learn about writers, read author blogs, and more.
Customer Reviews
|
There are no customer reviews yet.
|
|||
|
Video reviews
|
Inside This Book
(learn more)
Key Phrases - Statistically Improbable Phrases (SIPs):
(learn more)
concurrent dynamic backtracking, nonconcurrent constraints checks, nonconcurrent constraint checks, random message delays, check agent view, unsolvable message, inconsistent partial assignment, subproblem rooted, unassigned agents, lowest priority agent, lower priority agents, backtrack message, initializing agent, higher priority agents, distributed search algorithms, backtrack operation, inconsistent nogoods, lower priority neighbors, unary cost, assigning algorithms, consistent partial assignments, maintaining local consistency, culprit agent, current partial assignment, concurrent search Key Phrases - Capitalized Phrases (CAPs): (learn more)
Agent View, Constraints Satisfaction Problems, Distributed Constraint Optimization Problems, Empirical Evaluation of Heuristic Ordering, Constraints Optimization Problems, The Impact of Message Delays, The Impact of Communication, Realization of the Model, Optimal Asynchronous Partial Overlay, Asynchronous Ordering Heuristics, Algorithm Description, Asynchronous Forward-Bounding, Asynchronous Backtracking Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Surprise Me!
concurrent dynamic backtracking, nonconcurrent constraints checks, nonconcurrent constraint checks, random message delays, check agent view, unsolvable message, inconsistent partial assignment, subproblem rooted, unassigned agents, lowest priority agent, lower priority agents, backtrack message, initializing agent, higher priority agents, distributed search algorithms, backtrack operation, inconsistent nogoods, lower priority neighbors, unary cost, assigning algorithms, consistent partial assignments, maintaining local consistency, culprit agent, current partial assignment, concurrent search Key Phrases - Capitalized Phrases (CAPs): (learn more)
Agent View, Constraints Satisfaction Problems, Distributed Constraint Optimization Problems, Empirical Evaluation of Heuristic Ordering, Constraints Optimization Problems, The Impact of Message Delays, The Impact of Communication, Realization of the Model, Optimal Asynchronous Partial Overlay, Asynchronous Ordering Heuristics, Algorithm Description, Asynchronous Forward-Bounding, Asynchronous Backtracking Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Surprise Me!
Tag this product(What's this?)Think of a tag as a keyword or label you consider is strongly related to this product.
Tags will help all customers organize and find favorite items. |
Customer Discussions
|
This product's forum
Active discussions in related forums
Search Customer Discussions
|
Related forums
|
