Combinatorial Search: From Algorithms to Systems

• Κύριος συγγραφέας: Hamadi, Youssef (Συγγραφέας)
• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2013.
• Θέματα: Computer science.; Computers.; Computer science > Mathematics.; Artificial intelligence.; Mathematical optimization.; Computational intelligence.; Computer Science.; Artificial Intelligence (incl. Robotics).; Computational Intelligence.; Theory of Computation.; Optimization.; Discrete Mathematics in Computer Science.

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...

Πίνακας περιεχομένων:

• 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.