| 书目名称 | Combinatorial Search: From Algorithms to Systems | | 编辑 | Youssef Hamadi | | 视频video | | | 概述 | Summarizes the state of the art and proposes a clear architecture for solver and autonomous solvers.Case studies translate the theoretical ideas into real-world applications.Valuable for researchers a | | 图书封面 |  | | 描述 | .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 t | | 出版日期 | Book 2013 | | 关键词 | Autonomous search; Constraint networks; Constraint programming (CP); Constraint satisfaction problem (C | | 版次 | 1 | | doi | https://doi.org/10.1007/978-3-642-41482-4 | | isbn_softcover | 978-3-662-51429-0 | | isbn_ebook | 978-3-642-41482-4 | | copyright | Springer-Verlag Berlin Heidelberg 2013 |
The information of publication is updating
|
|
发表于 2025-3-21 18:06:39
