General

Authors

Search


Committee login



 
 

 


 

 

Forthcoming

Small thumbnail

Dynamics of Large Structures and Inverse Problems

Mathematical and Mechanical Engineering Set – Volume 5

Small thumbnail

Civil Engineering Structures According to the Eurocodes

Small thumbnail

Swelling Concrete in Dams and Hydraulic Structures

DSC 2017

Small thumbnail

Earthquake Occurrence

Short- and Long-term Models and their Validation

Small thumbnail

The Chemostat

Mathematical Theory of Microorganims Cultures

Small thumbnail

From Prognostics and Health Systems Management to Predictive Maintenance 2

Knowledge, Traceability and Decision

Small thumbnail

First Hitting Time Regression Models

Lifetime Data Analysis Based on Underlying Stochastic Processes

Small thumbnail

The Innovative Company

An Ill-defined Object

Small thumbnail

Reading and Writing Knowledge in Scientific Communities

Digital Humanities and Knowledge Construction

Small thumbnail

Going Past Limits To Growth

A Report to the Club of Rome EU-Chapter

Small thumbnail

Algorithms and Ordering Heuristics for Distributed Constraint Satisfaction Problems

FOCUS Series in Computer Science and Information Technology

Mohamed Wahbi, Ecole des Mines de Nantes, France

ISBN: 9781848215948

Publication Date: June 2013   Hardback   176 pp.

75.00 USD


Add to cart

eBooks


Ebook Ebook

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 of the problem, i.e. 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

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.

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.

Downloads

DownloadTables of Contents - PDF File - 52 Kb

































0.02480 s.