Get Free Shipping on orders over $79
Algorithms and Ordering Heuristics for Distributed Constraint Satisfaction Problems : FOCUS Series - Mohamed Wahbi

Algorithms and Ordering Heuristics for Distributed Constraint Satisfaction Problems

By: Mohamed Wahbi

Hardcover | 1 July 2013 | Edition Number 1

At a Glance

Hardcover


$375.75

or 4 interest-free payments of $93.94 with

 or 

Ships in 5 to 10 business days

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. This distribution is mainly due to privacy and/or security requirements. Therefore, a distributed model allowing a decentralized solving process is more adequate to model and solve such kinds of problem. The distributed constraint satisfaction problem has such properties.

Contents

Introduction
Part 1. Background on Centralized and Distributed Constraint Reasoning
1. Constraint Satisfaction Problems
2. Distributed Constraint Satisfaction Problems
Part 2. Synchronous Search Algorithms for DisCSPs
3. Nogood Based Asynchronous Forward Checking (AFC-ng)
4. Asynchronous Forward Checking Tree (AFC-tree)
5. Maintaining Arc Consistency Asynchronously in Synchronous Distributed Search
Part 3. Asynchronous Search Algorithms and Ordering Heuristics for DisCSPs
6. Corrigendum to "Min-domain Retroactive Ordering for Asynchronous Backtracking"
7. Agile Asynchronous BackTracking (Agile-ABT)
Part 4. DisChoco 2.0: A Platform for Distributed Constraint Reasoning
8. DisChoco 2.0
9. Conclusion

About the Authors

Mohamed Wahbi is currently an associate lecturer at Ecole des Mines de Nantes in France. He received his PhD degree in Computer Science from University Montpellier 2, France and Mohammed V University-Agdal, Morocco in 2012 and his research focused on Distributed Constraint Reasoning.

More in Mathematics

How to Win At Chess : The Ultimate Guide for Beginners and Beyond - Levy Rozman
A Little History of Mathematics : Little Histories - Snezana Lawrence
Humble Pi : A Comedy of Maths Errors - Matt Parker

RRP $26.99

$22.99

15%
OFF
The Golden Ratio : Divine Beauty of Mathematics - Gary B. Meisner

RRP $59.99

$45.75

24%
OFF
Statistics and Data Handling for Biologists : A Student's Guide - Neil Millar
The Score : How to Stop Playing Someone Else's Game - C. Thi Nguyen
Dynamics of Marine Structures - Yingguang  Wang

RRP $503.95

$442.99

12%
OFF
Second Grade Math with Confidence Bundle : Math with Confidence - Kate Snow
Calculus : 9th edition - Early Transcendentals, Metric - James Michael Stewart
Antifragile : Things That Gain from Disorder - Nassim Nicholas Taleb

RRP $27.99

$23.75

15%
OFF
Discrete Mathematics with Applications, Metric Edition : 5th edition - Susanna S. Epp
The Infinite Game : From the bestselling author of Start With Why - Simon Sinek
Oxford Maths for Australian Schools Year 4 Value Pack : 3rd Edition - Annie Facchinetti
The Black Swan : The Impact of the Highly Improbable - Nassim Nicholas Taleb