Optimal speedup of Las Vegas algorithms
Information Processing Letters
Boosting combinatorial search through randomization
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
GRASP: A Search Algorithm for Propositional Satisfiability
IEEE Transactions on Computers
A constraint-based approach to narrow search trees for satisfiability
Information Processing Letters
Chaff: engineering an efficient SAT solver
Proceedings of the 38th annual Design Automation Conference
Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems
Journal of Automated Reasoning
On Choosing a Task Assignment Policy for a Distributed Server System
TOOLS '98 Proceedings of the 10th International Conference on Computer Performance Evaluation: Modelling Techniques and Tools
Heuristics based on unit propagation for satisfiability problems
IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
IJCAI'99 Proceedings of the 16th international joint conference on Artificial intelligence - Volume 2
Using CSP look-back techniques to solve real-world SAT instances
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Restart Policies with Dependence among Runs: A Dynamic Programming Approach
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
A decomposition-based implementation of search strategies
ACM Transactions on Computational Logic (TOCL)
Randomised restarted search in ILP
Machine Learning
Discrete Applied Mathematics
A Restarted Strategy for Efficient Subsumption Testing
Fundamenta Informaticae - Progress on Multi-Relational Data Mining
A generative power-law search tree model
Computers and Operations Research
Backdoors to typical case complexity
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Tradeoffs in the complexity of backdoor detection
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Restart strategies in optimization: parallel and serial cases
Parallel Computing
Understanding the behavior of Solution-Guided Search for job-shop scheduling
Journal of Scheduling
Generating highly balanced sudoku problems as hard problems
Journal of Heuristics
An empirical study of optimal noise and runtime distributions in local search
SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
A Restarted Strategy for Efficient Subsumption Testing
Fundamenta Informaticae - Progress on Multi-Relational Data Mining
On Maximum Speedup Ratio of Restart Algorithm Portfolios
INFORMS Journal on Computing
| Hi-index | 0.00 |
Recently, it has been found that the cost distributions of randomized backtrack search in combinatorial domains are often heavytailed. Such heavy-tailed distributions explain the high variability observed when using backtrack-style procedures. A good understanding of this phenomenon can lead to better search techniques. For example, restart strategies provide a good mechanism for eliminating the heavy-tailed behavior and boosting the overall search performance. Several state-of-the-art SAT solvers now incorporate such restart mechanisms. The study of heavy-tailed phenomena in combinatorial search has so far been been largely based on empirical data. We introduce several abstract tree search models, and show formally how heavy-tailed cost distribution can arise in backtrack search. We also discuss how these insights may facilitate the development of better combinatorial search methods.