Combinatorial Search: From Algorithms to Systems

• Main Author: Hamadi, Youssef. (Author)
• Corporate Author: SpringerLink (Online service)
• Format: Electronic
• Language: English
• Published: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2013.
• Subjects: Computer science.; Information theory.; Computational complexity.; Artificial intelligence.; Mathematical optimization.; Engineering.; Computer Science.; Artificial Intelligence (incl. Robotics).; Computational Intelligence.; Theory of Computation.; Optimization.; Discrete Mathematics in Computer Science.
• Online Access: https://ezaccess.library.uitm.edu.my/login?url=http://dx.doi.org/10.1007/978-3-642-41482-4

Although they are believed to be unsolvable in general, tractability results suggest that some practical NP-hard problems can be efficiently solved. Combinatorial search algorithms are designed to efficiently explore the usually large solution space of these instances by reducing the search space to...

Table of Contents:

• Chap. 1 - Introduction
• Chap. 2 - Boosting Distributed Constraint Networks
• Chap. 3 - Parallel Tree Search for Satisfiability
• Chap. 4 - Parallel Local Search for Satisfiability
• Chap. 5 - Learning Variables Dependencies
• Chap. 6 - Continuous Search
• Chap. 7 - Autonomous Search
• Chap. 8 - Conclusion and Perspectives.