Optimal speedup of Las Vegas algorithms
Information Processing Letters
A filtering algorithm for constraints of difference in CSPs
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Expected gains from parallelizing constraint solving for hard problems
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Parallel speed-up of Monte Carlo methods for global optimization
Journal of Complexity
Easy problems are sometimes hard
Artificial Intelligence
Experimental results on the application of satisfiability algorithms to scheduling problems
AAAI'94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 2)
Phase transitions and the search problem
Artificial Intelligence - Special volume on frontiers in problem solving: phase transitions and complexity
A Computing Procedure for Quantification Theory
Journal of the ACM (JACM)
New methods to color the vertices of a graph
Communications of the ACM
A machine program for theorem-proving
Communications of the ACM
Computational Experience with an Interior Point Algorithm on the Satisfiability Problem
Proceedings of the 1st Integer Programming and Combinatorial Optimization Conference
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Optimal Parallelization of Las Vegas Algorithms
STACS '94 Proceedings of the 11th Annual Symposium on Theoretical Aspects of Computer Science
Validity of Normality Assumption in CSP Research
PRICAI '96 Proceedings of the 4th Pacific Rim International Conference on Artificial Intelligence: Topics in Artificial Intelligence
Scheduling a Major College Basketball Conference
Operations Research
Criticality and parallelism in combinatorial optimization
Criticality and parallelism in combinatorial optimization
The Gn,mphase transition is not hard for the Hamiltonian cycle problem
Journal of Artificial Intelligence Research
Heuristics based on unit propagation for satisfiability problems
IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
Sparse constraint graphs and exceptionally hard problems
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Pushing the envelope: planning, propositional logic, and stochastic search
AAAI'96 Proceedings of the thirteenth national 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
Problem structure in the presence of perturbations
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Summarizing CSP hardness with continuous probability distributions
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
A complexity analysis of space-bounded learning algorithms for the constraint satisfaction problem
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Algorithm portfolio design: theory vs. practice
UAI'97 Proceedings of the Thirteenth conference on Uncertainty in artificial intelligence
Proceedings of the 38th annual Design Automation Conference
A sharp threshold in proof complexity
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Local search characteristics of incomplete SAT procedures
Artificial Intelligence
SAT and ATPG: algorithms for Boolean decision problems
Logic Synthesis and Verification
An Overview of Backtrack Search Satisfiability Algorithms
Annals of Mathematics and Artificial Intelligence
Nagging: a scalable fault-tolerant paradigm for distributed search
Artificial Intelligence
PRICAI '02 Proceedings of the 7th Pacific Rim International Conference on Artificial Intelligence: Trends in Artificial Intelligence
Formal Models of Heavy-Tailed Behavior in Combinatorial Search
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
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
The Quest for Efficient Boolean Satisfiability Solvers
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
A Clause String DNA Algorithm for SAT
DNA 7 Revised Papers from the 7th International Workshop on DNA-Based Computers: DNA Computing
Journal of Symbolic Computation
Eighteenth national conference on Artificial intelligence
The threshold for random k-SAT is 2k (ln 2 - O(k))
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Performance models for large scale multiagent systems: using distributed POMDP building blocks
AAMAS '03 Proceedings of the second international joint conference on Autonomous agents and multiagent systems
Metaheuristics in combinatorial optimization: Overview and conceptual comparison
ACM Computing Surveys (CSUR)
Ilp: a short look back and a longer look forward
The Journal of Machine Learning Research
The Knowledge Engineering Review
Fast Theta-Subsumption with Constraint Satisfaction Algorithms
Machine Learning
A sharp threshold in proof complexity yields lower bounds for satisfiability search
Journal of Computer and System Sciences - STOC 2001
Heuristic average-case analysis of the backtrack resolution of random 3-satisfiability instances
Theoretical Computer Science
Enhancing Stochastic Search Performance by Value-Biased Randomization of Heuristics
Journal of Heuristics
Recognizing frozen variables in constraint satisfaction problems
Theoretical Computer Science
Randomised restarted search in ILP
Machine Learning
The power of choice in random walks: an empirical study
Proceedings of the 9th ACM international symposium on Modeling analysis and simulation of wireless and mobile systems
Applying SAT Solving in Classification of Finite Algebras
Journal of Automated Reasoning
Planning as satisfiability: parallel plans and algorithms for plan search
Artificial Intelligence
A decomposition approach to multi-vehicle cooperative control
Robotics and Autonomous Systems
Discrete Applied Mathematics
Visualizing SAT Instances and Runs of the DPLL Algorithm
Journal of Automated Reasoning
The power of choice in random walks: An empirical study
Computer Networks: The International Journal of Computer and Telecommunications Networking
Fast estimation of first-order clause coverage through randomization and maximum likelihood
Proceedings of the 25th international conference on Machine learning
Segment-based adaptive hyper-Erlang model for long-tailed network traffic approximation
The Journal of Supercomputing
Strategies for Solving SAT in Grids by Randomized Search
Proceedings of the 9th AISC international conference, the 15th Calculemas symposium, and the 7th international MKM conference on Intelligent Computer Mathematics
Dichotomic Search Protocols for Constrained Optimization
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Incorporating Learning in Grid-Based Randomized SAT Solving
AIMSA '08 Proceedings of the 13th international conference on Artificial Intelligence: Methodology, Systems, and Applications
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
Parallel and distributed local search in COMET
Computers and Operations Research
Empirical hardness models: Methodology and a case study on combinatorial auctions
Journal of the ACM (JACM)
Modeling choices in quasigroup completion: SAT vs. CSP
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Diagnosis of discrete-event systems using satisfiability algorithms
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Combining multiple heuristics online
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
Nogood recording from restarts
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Backdoors to typical case complexity
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Journal of Artificial Intelligence Research
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Optimal refutations for constraint satisfaction problems
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
The backbone of the travelling salesperson
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Planning as satisfiability: parallel plans and algorithms for plan search
Artificial Intelligence
Predicting learnt clauses quality in modern SAT solvers
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Partitioning Search Spaces of a Randomized Search
AI*IA '09: Proceedings of the XIth International Conference of the Italian Association for Artificial Intelligence Reggio Emilia on Emergent Perspectives in Artificial Intelligence
Taming the Complexity of Inductive Logic Programming
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
Lattice-search runtime distributions may be heavy-tailed
ILP'02 Proceedings of the 12th international conference on Inductive logic programming
Relaxation of qualitative constraint networks
SARA'07 Proceedings of the 7th International conference on Abstraction, reformulation, and approximation
Tradeoffs in the complexity of backdoor detection
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
On universal restart strategies for backtracking search
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Hierarchical hardness models for SAT
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Constraint-based agents: an architecture for constraint-based modeling and local-search-based reasoning for planning and scheduling in open and dynamic worlds
Diversification and intensification in parallel SAT solving
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
Algorithm selection as a bandit problem with unbounded losses
LION'10 Proceedings of the 4th international conference on Learning and intelligent optimization
Bit-vector algorithms for binary constraint satisfaction and subgraph isomorphism
Journal of Experimental Algorithmics (JEA)
Understanding the behavior of Solution-Guided Search for job-shop scheduling
Journal of Scheduling
On the practical side of answer set programming
Logic programming, knowledge representation, and nonmonotonic reasoning
Optimization of heuristic search using recursive algorithm selection and reinforcement learning
Annals of Mathematics and Artificial Intelligence
Generating highly balanced sudoku problems as hard problems
Journal of Heuristics
Solving problems with CP: four common pitfalls to avoid
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Synthesis of search algorithms from high-level CP models
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Domain-splitting generalized nogoods from restarts
EPIA'11 Proceedings of the 15th Portugese conference on Progress in artificial intelligence
Algorithm portfolio selection as a bandit problem with unbounded losses
Annals of Mathematics and Artificial Intelligence
A bayesian approach to tackling hard computational problems
UAI'01 Proceedings of the Seventeenth conference on Uncertainty in artificial intelligence
On the impact of small-world on local search
AI*IA'05 Proceedings of the 9th conference on Advances in Artificial Intelligence
Impact of censored sampling on the performance of restart strategies
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Performance prediction and automated tuning of randomized and parametric algorithms
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Distributed constraint-based local search
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Randomization in constraint programming for airline planning
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Failure analysis in backtrack search for constraint satisfaction
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Statistical methodology for comparison of SAT solvers
SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
Characterizing propagation methods for boolean satisfiability
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
A distribution method for solving SAT in grids
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
A genetic algorithm hybridized with the discrete lagrangian method for trap escaping
LION'05 Proceedings of the 5th international conference on Learning and Intelligent Optimization
A hardware relaxation paradigm for solving NP-hard problems
VoCS'08 Proceedings of the 2008 international conference on Visions of Computer Science: BCS International Academic Conference
Partitioning Search Spaces of a Randomized Search
Fundamenta Informaticae - RCRA 2009 Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion
A Restarted Strategy for Efficient Subsumption Testing
Fundamenta Informaticae - Progress on Multi-Relational Data Mining
Planning as satisfiability: Heuristics
Artificial Intelligence
Refining restarts strategies for SAT and UNSAT
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Parallel algorithm configuration
LION'12 Proceedings of the 6th international conference on Learning and Intelligent Optimization
Evaluation of a simple, scalable, parallel best-first search strategy
Artificial Intelligence
Asynchronous multi-core incremental SAT solving
TACAS'13 Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Average-case complexity of backtrack search for coloring sparse random graphs
Journal of Computer and System Sciences
Soundness of inprocessing in clause sharing SAT solvers
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Algorithm runtime prediction: Methods & evaluation
Artificial Intelligence
Hi-index | 0.00 |
We study the runtime distributions of backtrack procedures for propositional satisfiability and constraint satisfaction. Such procedures often exhibit a large variability in performance. Our study reveals some intriguing properties of such distributions: They are often characterized by very long tails or “heavy tails”. We will show that these distributions are best characterized by a general class of distributions that can have infinite moments (i.e., an infinite mean, variance, etc.). Such nonstandard distributions have recently been observed in areas as diverse as economics, statistical physics, and geophysics. They are closely related to fractal phenomena, whose study was introduced by Mandelbrot. We also show how random restarts can effectively eliminate heavy-tailed behavior. Furthermore, for harder problem instances, we observe long tails on the left-hand side of the distribution, which is indicative of a non-negligible fraction of relatively short, successful runs. A rapid restart strategy eliminates heavy-tailed behavior and takes advantage of short runs, significantly reducing expected solution time. We demonstrate speedups of up to two orders of magnitude on SAT and CSP encodings of hard problems in planning, scheduling, and circuit synthesis.