Algorithms and Ordering Heuristics for D
β Mohamed Wahbi(auth.)
π Library
π
2013
π Wiley-ISTE
π English
β¦ LIBER β¦
π
Algorithms and Ordering Heuristics for Distributed Constraint Satisfaction Problems
β Scribed by Mohamed Wahbi
- Publisher
- Wiley-ISTE
- Year
- 2013
- Tongue
- English
- Leaves
- 166
- Series
- FOCUS Series
- Edition
- 1
- Category
- Library
β¬ Acquire This Volume
No coin nor oath required. For personal study only.
β¦ Synopsis
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.
π SIMILAR VOLUMES
Constraint Satisfaction Problems
π Library
π
2013
π Wiley-ISTE
π English
<p>A Constraint Satisfaction Problem (CSP) consists of a set of variables, a domain of values for each variable and a set of constraints. The objective is to assign a value for each variable such that all constraints are satisfied. CSPs continue to receive increased attention because of both their h
A Class of Algorithms for Distributed Co
β A. Petcu
π Library
π
2009
π IOS Press
π English
Multi Agent Systems (MAS) have recently attracted a lot of interest because of their ability to model many real life scenarios where information and control are distributed among a set of different agents. Practical applications include planning, scheduling, distributed control, resource allocation
A Class of Algorithms for Distributed Co
β A. Petcu
π Library
π
2009
π IOS Press
π English
Multi Agent Systems (MAS) have recently attracted a lot of interest because of their ability to model many real life scenarios where information and control are distributed among a set of different agents. Practical applications include planning, scheduling, distributed control, resource allocation
A Class of Algorithms for Distributed Co
β Adrian Petcu
π Library
π
2009
π IOS Press
π English
The Complexity of Valued Constraint Sati
β Stanislav Ε½ivnΓ½ (auth.)
π Library
π
2012
π Springer-Verlag Berlin Heidelberg
π English
<p><p>The topic of this book is the following optimisation problem: given a set of discrete variables and a set of functions, each depending on a subset of the variables, minimise the sum of the functions over all variables. This fundamental research problem has been studied within several different