Combinatorial Search: From Algorithms to Systems

Nonfiction, Computers, Advanced Computing, Artificial Intelligence, Computer Science, General Computing
Cover of the book Combinatorial Search: From Algorithms to Systems by Youssef Hamadi, Springer Berlin Heidelberg
View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart
Author: Youssef Hamadi ISBN: 9783642414824
Publisher: Springer Berlin Heidelberg Publication: October 29, 2013
Imprint: Springer Language: English
Author: Youssef Hamadi
ISBN: 9783642414824
Publisher: Springer Berlin Heidelberg
Publication: October 29, 2013
Imprint: Springer
Language: English

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 feasible regions and using heuristics to efficiently explore these regions. Various mathematical formalisms may be used to express and tackle combinatorial problems, among them the constraint satisfaction problem (CSP) and the propositional satisfiability problem (SAT). These algorithms, or constraint solvers, apply search space reduction through inference techniques, use activity-based heuristics to guide exploration, diversify the searches through frequent restarts, and often learn from their mistakes.

In this book the author focuses on knowledge sharing in combinatorial search, the capacity to generate and exploit meaningful information, such as redundant constraints, heuristic hints, and performance measures, during search, which can dramatically improve the performance of a constraint solver. Information can be shared between multiple constraint solvers simultaneously working on the same instance, or information can help achieve good performance while solving a large set of related instances. In the first case, information sharing has to be performed at the expense of the underlying search effort, since a solver has to stop its main effort to prepare and commu

nicate the information to other solvers; on the other hand, not sharing information can incur a cost for the whole system, with solvers potentially exploring unfeasible spaces discovered by other solvers. In the second case, sharing performance measures can be done with little overhead, and the goal is to be able to tune a constraint solver in relation to the characteristics of a new instance – this corresponds to the selection of the most suitable algorithm for solving a given instance.

The book is suitable for researchers, practitioners, and graduate students working in the areas of optimization, search, constraints, and computational complexity.

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

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 feasible regions and using heuristics to efficiently explore these regions. Various mathematical formalisms may be used to express and tackle combinatorial problems, among them the constraint satisfaction problem (CSP) and the propositional satisfiability problem (SAT). These algorithms, or constraint solvers, apply search space reduction through inference techniques, use activity-based heuristics to guide exploration, diversify the searches through frequent restarts, and often learn from their mistakes.

In this book the author focuses on knowledge sharing in combinatorial search, the capacity to generate and exploit meaningful information, such as redundant constraints, heuristic hints, and performance measures, during search, which can dramatically improve the performance of a constraint solver. Information can be shared between multiple constraint solvers simultaneously working on the same instance, or information can help achieve good performance while solving a large set of related instances. In the first case, information sharing has to be performed at the expense of the underlying search effort, since a solver has to stop its main effort to prepare and commu

nicate the information to other solvers; on the other hand, not sharing information can incur a cost for the whole system, with solvers potentially exploring unfeasible spaces discovered by other solvers. In the second case, sharing performance measures can be done with little overhead, and the goal is to be able to tune a constraint solver in relation to the characteristics of a new instance – this corresponds to the selection of the most suitable algorithm for solving a given instance.

The book is suitable for researchers, practitioners, and graduate students working in the areas of optimization, search, constraints, and computational complexity.

More books from Springer Berlin Heidelberg

Cover of the book Elbow and Sport by Youssef Hamadi
Cover of the book Interstellar Molecules by Youssef Hamadi
Cover of the book Transition Metal Catalyzed Enantioselective Allylic Substitution in Organic Synthesis by Youssef Hamadi
Cover of the book Gesundheit! by Youssef Hamadi
Cover of the book Gastrointestinal and Liver Tumors by Youssef Hamadi
Cover of the book Structure and Reactivity of Coal by Youssef Hamadi
Cover of the book Digestive System by Youssef Hamadi
Cover of the book Studying Atomic Dynamics with Coherent X-rays by Youssef Hamadi
Cover of the book Cervical Cancer by Youssef Hamadi
Cover of the book Organometallics as Catalysts in the Fine Chemical Industry by Youssef Hamadi
Cover of the book Fast Software Encryption by Youssef Hamadi
Cover of the book The Natural Environment and the Biogeochemical Cycles by Youssef Hamadi
Cover of the book Groundwater in Ethiopia by Youssef Hamadi
Cover of the book Data Mining for Service by Youssef Hamadi
Cover of the book Information Systems for eGovernment by Youssef Hamadi
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