On Universal Restart Strategies for Backtracking Search

DOI10.1007/978-3-540-74970-7_48MaRDI QIDQ3523083zbMATH OpenOpenAlexFDO

Authors Huayue Wu, P. van Beek

Publication date 2 September 2008

Published in Principles and Practice of Constraint Programming – CP 2007 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-74970-7_48

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Recent Advances in Constraints
• Ensemble-based prediction of SAT search behaviour
• Accelerating backtrack search with a best-first-search strategy
• Random backtracking in backtrack search algorithms for satisfiability
• Local Restarts

Cites work

• Ensemble-based prediction of SAT search behaviour
• Heavy-tailed phenomena in satisfiability and constraint satisfaction problems
• Optimal speedup of Las Vegas algorithms
• Theory and Applications of Satisfiability Testing

Cited in

(7)

• Accelerating backtrack search with a best-first-search strategy
• Ant colony optimization for path planning in search and rescue operations
• Explorative anytime local search for distributed constraint optimization
• Ensemble-based prediction of SAT search behaviour
• An optimal constraint programming approach to the open-shop problem
• A Hybrid Constraint Programming / Local Search Approach to the Job-Shop Scheduling Problem
• Recent Advances in Constraints

Describes a project that uses

Uses Software

• MiniSat

This page was built for publication: On Universal Restart Strategies for Backtracking Search

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3523083)