My Wish Lists Login / Join

Advanced Information and Knowledge Processing

Algorithms, Performance, Communication

By: Amnon Meisels

Write A Review

Hardcover | 3 December 2007 | Edition Number 2

At a Glance

Hardcover
240 Pages

Dimensions(cm)
23.5 x 15.88 x 1.91

Hardcover

$169.00

or 4 interest-free payments of $42.25 with

Ships in 5 to 7 business days

Distributed search by agents is an important topic of distributed AI and has not been treated thoroughly as such. While the scope of work on multi-agent systems has grown steadily over the last decade, very little of it has spilled into distributed search. In conrast, the constraints processing community has produced a sizable body of work on distributed constrained search. Parado- cally, a community that concentrates on search algorithms and heuristics has created a distributed model for agents that cooperate on solving hard search problems. Traditionally, this ?eld has been named Ditributed Constraints S- isfaction and lately also distributed constraints optimization. The present book attempts to prompt deeper response from the MAS community and hopefully to give rise to cooperative work on distributed search by agents. In order to achieve this high goal, the book presents the large body of work on distributed search by constrained agents. The presentation emphasizes many aspects of distributed computation that connect naturally to multi-agent systems, - pecially measures of performance for distributed search algorithms and the impact of delays in communication. Distributed Constraints Satisfaction Problems (DisCSPs) have been st- ied over the last decade, starting with the pioneering proposal by Makoto Yokoo 18]. The ?rst distributed search algorithm for DisCSPs - As- chronous Backtracking (ABT) - was ?rst published in complete format in 1998 64]. The ?rst book on Distributed Constraints Satisfaction Problems has appeared as early as 2000 61].

Shipping

	Standard Shipping	Express Shipping
Metro postcodes:	$9.99	$14.95
Regional postcodes:	$9.99	$14.95
Rural postcodes:	$9.99	$14.95

Orders over $79.00 qualify for free shipping.

How to return your order

At Booktopia, we offer hassle-free returns in accordance with our returns policy. If you wish to return an item, please get in touch with Booktopia Customer Care.

Additional postage charges may be applicable.

Defective items

If there is a problem with any of the items received for your order then the Booktopia Customer Care team is ready to assist you.

For more info please visit our Help Centre.

You Can Find This Book In

Non-Fiction Computing & I.T.Computer Science Artificial Intelligence Computer Programming & Software Development Algorithms & Data Structures Databases

Introduction	p. 1
Constraints Satisfaction Problems - CSPs	p. 7
Defining CSPs	p. 8
CSP Algorithms and Techniques	p. 10
Behavior of CSP solving algorithms	p. 13
Constraints Optimization Problems - COPs	p. 19
Branch and Bound (BnB)	p. 20
Branch and Bound + Arc-Consistency (BnB-AC)	p. 23
Branch and Bound + AC* (BnB-AC*)	p. 24
Phase Transition in MaxCSPs	p. 25
Distributed Search	p. 27
Distributed search algorithms on DisCSPs	p. 30
Introducing Asynchronous Backtracking	p. 33
Asynchronous Backtracking (ABT)	p. 37
A Complete 4-Queens Example	p. 40
The ABT Algorithm - Polynomial Storage	p. 43
Correctness of ABT	p. 47
Improving Performance of ABT	p. 49
Asynchronous Forward-Checking	p. 53
AFC - Algorithm Description	p. 55
Correctness of AFC	p. 59
Improved Backtrack Method for AFC	p. 61
Concurrent Dynamic Backtracking	p. 63
4-Queens with Concurrent Search	p. 65
The ConcBT Algorithm	p. 67
A splitting of search space example	p. 72
Concurrent Dynamic Backtracking	p. 75
Correctness of Concurrent Search	p. 79
Distributed Ordering Heuristics	p. 83
Ordering heuristics for Synchronous Backjumping	p. 85
Heuristics with no additional messages	p. 85
Heuristics with additional network overhead	p. 86
Ordering heuristics for AFC	p. 86
Asynchronous Ordering Heuristics	p. 89
Specific Asynchronous Heuristics	p. 89
Dynamically ordered ABT	p. 91
Correctness of ABT	p. DO
A new class of asynchronous heuristics	p. 97
Correctness of Retroactive ABT	p. DO
Performance measures for distributed search	p. 105
A Simple Example with Naive Methods	p. 107
Dividing concurrent search into rounds	p. 108
A More Complex Example for Computing NCCCs	p. 110
A Model for Nonconcurrent Constraints Checks	p. 111
The Cumulative Cost Algorithm (CCA)	p. 113
Realization of the Model by the CCA Algorithm	p. 115
Experimental Evaluation of DisCSP Algorithms	p. 121
Comparing Different Algorithms	p. 122
Asynchronous forward-checking vs. ABT	p. 122
Experimental evaluation of ConcDB	p. 123
Empirical Evaluation of Heuristic Ordering	p. 125
Evaluation of synchronous ordering heuristics	p. 126
Evaluation of dynamically ordered ABT	p. 128
Retroactive ordering for ABT	p. 133
The Impact of Communication - Message Delays	p. 137
Simulating Delayed Messages on DisCSPs	p. 139
Adjusting the measuring method for dynamic ordering	p. 140
Validity of AMDS	p. 141
Message Delays and DisCSP Search Algorithms	p. 143
The Impact of Message Delays	p. 145
A summary of the Impact of Message Delays	p. 154
Message Delays and Dynamic Ordering	p. 156
Distributed Constraint Optimization Problems (DisCOPs) 159
Pseudo-trees	p. 160
Synchronous Branch and Bound (SBB)	p. 161
Distributed Pseudo-tree Optimization (DPOP)	p. 162
Optimal Asynchronous Partial Overlay (OptAPO)	p. 164
Asynchronous Optimization for DisCOPs	p. 169
Lower and Upper Bounds in ADOPT	p. 170
Computing lower and upper bounds	p. 171
Assigning Values	p. 172
The Threshold Mechanism	p. 175
ADOPT - Summary and Termination	p. 176
Special (and Surprising) Features of ADOPT	p. 178
Updating context from lower priority agents	p. 179
Pseudo-trees and concurrency of computation	p. 180
Network load of ADOPT	p. 182
Asynchronous Forward-Bounding	p. 183
AFB - Overview	p. 183
Lower Bound Estimation for the Cost Increment	p. 184
AFB - Algorithm Description	p. 186
The Time-Stamp Mechanism	p. 188
AFB - Proof of Correctness	p. 189
Concurrency in AFB	p. 190
Extending AFB - BackJumping	p. 193
Adding Value Ordering Heuristics	p. 194
Backjumping - Key Concepts	p. 194
A Backjumping Example	p. 196
The AFB-BJ Algorithm	p. 198
AFB-BJ - Proof of Correctness	p. 201
Empirical Evaluation of DisCOP algorithms	p. 203
Empirical Evaluation of AFB and AFB-BJ	p. 204
References	p. 209
Index	p. 215
Table of Contents provided by Publisher. All Rights Reserved.

Advanced Information and Knowledge Processing

Algorithms, Performance, Communication

At a Glance

Hardcover

Shipping

How to return your order

Defective items

You Can Find This Book In

More in Algorithms & Data Structures

Computability and Computational Explanation

Elements in the Philosophy of Mathematics

The Man Who Solved the Market

How Jim Simons Launched the Quant Revolution SHORTLISTED FOR THE FT & MCKINSEY BUSINESS BOOK OF THE YEAR AWARD 2019

Addiction by Design

Machine Gambling in Las Vegas

Algorithms in C, Parts 1-4

3rd Edition - Fundamentals, Data Structures, Sorting, Searching

Introduction to Machine Learning with Python

A Guide for Data Scientists

Code Dependent

Living in the Shadow of AI - Shortlisted for the Women's Prize for Non-Fiction

Learning Algorithms

A Programmer's Guide to Writing Better Code

Python for Algorithmic Trading

From Idea to Cloud Deployment

How to Prove It

A Structured Approach

The Delicate Art of Brute Force

How to Compute It When You Can't Solve It

Code Dependent

Living in the Shadow of AI

Data-Driven Modeling & Scientific Computation

Methods for Complex Systems & Big Data

Hacker's Delight

Artificial Intelligence Programming with Python

From Zero to Hero

Reset

Reclaiming the Internet for Civil Society

Reconceiving AI

The World as an Apple or a Blue Orange

Reconceiving AI

The World as an Apple or a Blue Orange

Considerations on the AI Endgame

Ethics, Risks and Computational Frameworks

Quick Data Structures

Quick Programming

Artificial Intelligence for Art Creation and Understanding

Multimedia Computing, Communication and Intelligence

Fundamentals of Data Structures and Algorithms

Fundamentals of Data Structures and Algorithms

Explainable Artificial Intelligence and Interpretable Machine Learning in Education

A Researcher's Guide to Data Science

Recursion

Mathematics and Python

This product is categorised by