Algorithms and Ordering Heuristics for Distributed Constraint Satisfaction Problems

Nonfiction, Computers, Programming
Cover of the book Algorithms and Ordering Heuristics for Distributed Constraint Satisfaction Problems by Mohamed Wahbi, Wiley
View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart
Author: Mohamed Wahbi ISBN: 9781118753422
Publisher: Wiley Publication: July 1, 2013
Imprint: Wiley-ISTE Language: English
Author: Mohamed Wahbi
ISBN: 9781118753422
Publisher: Wiley
Publication: July 1, 2013
Imprint: Wiley-ISTE
Language: English

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.

View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart

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 books from Wiley

Cover of the book Donor-Centered Planned Gift Marketing by Mohamed Wahbi
Cover of the book Hospital Images by Mohamed Wahbi
Cover of the book Wireless Power Transfer for Electric Vehicles and Mobile Devices by Mohamed Wahbi
Cover of the book Food Webs and Biodiversity by Mohamed Wahbi
Cover of the book Bauphysik Kalender 2014 by Mohamed Wahbi
Cover of the book Understanding Historic Building Conservation by Mohamed Wahbi
Cover of the book Dentist's Guide to Medical Conditions, Medications and Complications by Mohamed Wahbi
Cover of the book Business Ratios and Formulas by Mohamed Wahbi
Cover of the book Handbook of Jealousy by Mohamed Wahbi
Cover of the book High Wire Act by Mohamed Wahbi
Cover of the book The Practical Guide to Project Management Documentation by Mohamed Wahbi
Cover of the book Forensic Archaeology by Mohamed Wahbi
Cover of the book Little Black Book der Frauenverführung by Mohamed Wahbi
Cover of the book Global Covenant by Mohamed Wahbi
Cover of the book Geography by Mohamed Wahbi
We use our own "cookies" and third party cookies to improve services and to see statistical information. By using this website, you agree to our Privacy Policy