Algorithms and Ordering Heuristics for Distributed Constraint Satisfaction Problems
Book Details:
| Publisher: | Wiley-ISTE |
| Series: | Wiley |
| Author: | Mohamed Wahbi |
| Edition: | 1 |
| ISBN-10: | 1848215940 |
| ISBN-13: | 9781848215948 |
| Pages: | 176 |
| Published: | Jul 10 2013 |
| Posted: | Nov 19 2014 |
| Language: | English |
| Book format: | |
| Book size: | 2.58 MB |
Book Description:
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.ContentsIntroductionPart 1. Background on Centralized and Distributed Constraint Reasoning1. Constraint Satisfaction Problems2. Distributed Constraint Satisfaction ProblemsPart 2. Synchronous Search Algorithms for DisCSPs3. Nogood Based Asynchronous Forward Checking (AFC-ng)4. Asynchronous Forward Checking Tree (AFC-tree)5. Maintaining Arc Consistency Asynchronously in Synchronous Distributed SearchPart 3. Asynchronous Search Algorithms and Ordering Heuristics for DisCSPs6. 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 Reasoning8. DisChoco 2.09. ConclusionAbout the AuthorsMohamed 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.
Download Link:
Related Books:
Constraint Satisfaction Problems
CSP Formalisms and Techniques
A Constraint Satisfaction Problem (CSP) consists of a set ofvariables, a domain of values for each variable and a set ofconstraints. The objective is to assign a value for each variablesuch that all constraints are satisfied. CSPs continue to receiveincreased attention because of both their high complexity and theiromnipresence in academic, industrial and even reallife problems.This is why they are the subject of intense research in bothartificial intelligence and operations research. This bookintroduces the classic CSP and details severalextensions/improvements of both formalisms and techniques in orderto tackle a large variety of problems. Consistency, flexible,dynamic, distributed and learning aspects are discussed andillustrated using simple exam...
Knapsack Problems
Algorithms and Computer Implementations
Here is a state of art examination on exact and approximate algorithms for a number of important NP-hard problems in the field of integer linear programming, which the authors refer to as ``knapsack.'' Includes not only the classical knapsack problems such as binary, bounded, unbounded or binary multiple, but also less familiar problems such as subset-sum and change-making. Well known problems that are not usually classified in the knapsack area, including generalized assignment and bin packing, are also covered. The text fully develops an algorithmic approach without losing mathematical rigor....
Distributed Computing
Principles, Algorithms, and Systems
Designing distributed computing systems is a complex process requiring a solid understanding of the design problems and the theoretical and practical aspects of their solutions. This comprehensive textbook covers the fundamental principles and models underlying the theory, algorithms and systems aspects of distributed computing. Broad and detailed coverage of the theory is balanced with practical systems-related issues such as mutual exclusion, deadlock detection, authentication, and failure recovery. Algorithms are carefully selected, lucidly presented, and described without complex proofs. Simple explanations and illustrations are used to elucidate the algorithms. Important emerging topics such as peer-to-peer networks and network security are also...
2007 - 2021 © eBooks-IT.org