Combinatorial aspects of construction of competition Dutch Professional Football Leagues
Discrete Applied Mathematics - Special issue: Timetabling and chromatic scheduling
Optimal speedup of Las Vegas algorithms
Information Processing Letters
Easy problems are sometimes hard
Artificial Intelligence
Constraint-based reasoning
Experimental results on the application of satisfiability algorithms to scheduling problems
AAAI'94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 2)
ACM Computing Surveys (CSUR) - Special issue: position statements on strategic directions in computing research
A machine program for theorem-proving
Communications of the ACM
Scheduling a Major College Basketball Conference
Operations Research
Journal of Artificial Intelligence Research
Domain-independent extensions to GSAT: solving large structured satisfiability problems
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
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
Stochastic procedures for generating feasible schedules
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Heuristic-biased stochastic sampling
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Morphing: combining structure and randomness
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Distributed reinforcement learning for a traffic engineering application
AGENTS '00 Proceedings of the fourth international conference on Autonomous agents
Boolean satisfiability in electronic design automation
Proceedings of the 37th 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
Backjump-based backtracking for constraint satisfaction problems
Artificial Intelligence
Local search for distributed SAT with complex local problems
Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 3
Encoding domain knowledge for prositional planning
Logic-based 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
A Subset-Matching Size-Bounded Cache for Testing Satisfiability in Modal Logics
Annals of Mathematics and Artificial Intelligence
RESTART Technology for Solving Discrete Optimization Problems
Cybernetics and Systems Analysis
Local Search Algorithms for SAT: An Empirical Evaluation
Journal of Automated Reasoning
Phase Transitions in Relational Learning
Machine Learning
Efficient conflict driven learning in a boolean satisfiability solver
Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design
Faster SAT and smaller BDDs via common function structure
Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design
Comparing approaches to the exploration of the domain of residue classes
Journal of Symbolic Computation - Integrated reasoning and algebra systems
Towards Provably Complete Stochastic Search Algorithms for Satisfiability
EPIA '01 Proceedings of the10th Portuguese Conference on Artificial Intelligence on Progress in Artificial Intelligence, Knowledge Extraction, Multi-agent Systems, Logic Programming and Constraint Solving
Towards Local Search for Answer Sets
ICLP '02 Proceedings of the 18th International Conference on Logic Programming
Solving the Sports League Scheduling Problem with Tabu Search
ECAI '00 Proceedings of the Workshop on Local Search for Planning and Scheduling-Revised Papers
Robust SAT-Based Search Algorithm for Leakage Power Reduction
PATMOS '02 Proceedings of the 12th International Workshop on Integrated Circuit Design. Power and Timing Modeling, Optimization and Simulation
A Hybrid Seachr Architecture Applied to Hard Random 3-SAT and Low-Autocorrelation Binary Sequences
CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
Using Randomization and Learning to Solve Hard Real-World Instances of Satisfiability
CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
Formal Models of Heavy-Tailed Behavior in Combinatorial Search
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Amplification of Search Performance through Randomization of Heuristics
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Communication and Computation in Distributed CSP Algorithms
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
Systematic vs. Local Search for SAT
KI '99 Proceedings of the 23rd Annual German Conference on Artificial Intelligence: Advances in Artificial Intelligence
The Quest for Efficient Boolean Satisfiability Solvers
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Classifying Isomorphic Residue Classes
Computer Aided Systems Theory - EUROCAST 2001-Revised Papers
A mixture-model for the behaviour of SLS algorithms for SAT
Eighteenth national conference on Artificial intelligence
Eighteenth national conference on Artificial intelligence
Optimal schedules for parallelizing anytime algorithms: the case of independent processes
Eighteenth national conference on Artificial intelligence
On the Fine Structure of Large Search Spaces
ICTAI '99 Proceedings of the 11th IEEE International Conference on Tools with Artificial Intelligence
Search Strategies for Hybrid Search Spaces
ICTAI '99 Proceedings of the 11th IEEE International Conference on Tools with Artificial Intelligence
On the limit of branching rules for hard random unsatisfiable 3-SAT
Discrete Applied Mathematics - The renesse issue on satisfiability
SAT problems with chains of dependent variables
Discrete Applied Mathematics - The renesse issue on satisfiability
Efficient solution techniques for disjunctive temporal reasoning problems
Artificial Intelligence
Combining linear programming and satisfiability solving for resource planning
The Knowledge Engineering Review
The Knowledge Engineering Review
Bridging the gap between planning and scheduling
The Knowledge Engineering Review
Applying integer programming to AI planning
The Knowledge Engineering Review
A sharp threshold in proof complexity yields lower bounds for satisfiability search
Journal of Computer and System Sciences - STOC 2001
DATE '03 Proceedings of the conference on Design, Automation and Test in Europe - Volume 1
Annals of Mathematics and Artificial Intelligence
Efficient Data Structures for Backtrack Search SAT Solvers
Annals of Mathematics and Artificial Intelligence
A linear-time algorithm to solve the Sports League Scheduling Problem (prob026 of CSPLib)
Discrete Applied Mathematics
IEEE Intelligent Systems
Enhancing Stochastic Search Performance by Value-Biased Randomization of Heuristics
Journal of Heuristics
Sensor networks and distributed CSP: communication, computation and complexity
Artificial Intelligence - Special issue: Distributed constraint satisfaction
A unified framework for partial and hybrid search methods in constraint programming
Computers and Operations Research
Cut-and-solve: an iterative search strategy for combinatorial optimization problems
Artificial Intelligence
Propositional satisfiability: techniques, algorithms and applications
AI Communications
MathSAT: Tight Integration of SAT and Mathematical Decision Procedures
Journal of Automated Reasoning
Heuristic-Based Backtracking Relaxation for Propositional Satisfiability
Journal of Automated Reasoning
Propositional Satisfiability and Constraint Programming: A comparative survey
ACM Computing Surveys (CSUR)
Efficient theory combination via boolean search
Information and Computation - Special issue: Combining logical systems
Substitutions into propositional tautologies
Information Processing Letters
Interpolant Learning and Reuse in SAT-Based Model Checking
Electronic Notes in Theoretical Computer Science (ENTCS)
Discrete Applied Mathematics
BerkMin: A fast and robust Sat-solver
Discrete Applied Mathematics
Random backtracking in backtrack search algorithms for satisfiability
Discrete Applied Mathematics
Robotics and Autonomous Systems
Proof planning with multiple strategies
Artificial Intelligence
Understanding the role of noise in stochastic local search: Analysis and experiments
Artificial Intelligence
Using solution properties within an enumerative search to solve a sports league scheduling problem
Discrete Applied Mathematics
A practical reconfigurable hardware accelerator for Boolean satisfiability solvers
Proceedings of the 45th annual Design Automation Conference
Model checking with Boolean Satisfiability
Journal of Algorithms
A generative power-law search tree model
Computers and Operations Research
Boolean satisfiability from theoretical hardness to practical success
Communications of the ACM - A Blind Person's Interaction with Technology
Formalization and Implementation of Modern SAT Solvers
Journal of Automated Reasoning
On Probing and Multi-Threading in PLATYPUS
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Backdoors in the Context of Learning
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Restart Strategy Selection Using Machine Learning Techniques
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Problem-Sensitive Restart Heuristics for the DPLL Procedure
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
The backdoor key: a path to understanding problem hardness
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
The U.S. national football league scheduling problem
IAAI'04 Proceedings of the 16th conference on Innovative applications of artifical intelligence
Restart schedules for ensembles of problem instances
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
Planning graph as a (dynamic) CSP: exploiting EBL, DDB and other CSP search techniques in Graphplan
Journal of Artificial Intelligence Research
On reachability, relevance, and resolution in the planning as satisfiability approach
Journal of Artificial Intelligence Research
Optimal schedules for parallelizing anytime algorithms: the case of shared resources
Journal of Artificial Intelligence Research
Towards understanding and harnessing the potential of clause learning
Journal of Artificial Intelligence Research
Solution-guided multi-point constructive search for job shop scheduling
Journal of Artificial Intelligence Research
The Gn,mphase transition is not hard for the Hamiltonian cycle problem
Journal of Artificial Intelligence Research
Journal of Artificial Intelligence Research
Journal of Artificial Intelligence Research
The LPSAT engine & its application to resource planning
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
Unifying SAT-based and graph-based planning
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
Reachability, relevance, resolution and the planning as satisfiability approach
IJCAI'99 Proceedings of the 16th international joint conference on Artificial intelligence - Volume 2
To encode or not to encode-1: linear planning
IJCAI'99 Proceedings of the 16th international joint conference on Artificial intelligence - Volume 2
IJCAI'99 Proceedings of the 16th international joint conference on Artificial intelligence - Volume 2
The effect of restarts on the efficiency of clause learning
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
Understanding the power of clause learning
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
A simplifier for propositional formulas with many binary clauses
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
CABOB: a fast optimal algorithm for combinatorial auctions
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 2
Bin-completion algorithms for multicontainer packing and covering problems
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Sensor networks and distributed CSP: communication, computation and complexity
Artificial Intelligence - Special issue: Distributed constraint satisfaction
Cut-and-solve: An iterative search strategy for combinatorial optimization problems
Artificial Intelligence
Control-based clause sharing in parallel SAT solving
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Iterated mutation in an evolutionary algorithm for Sudoku
AIA '08 Proceedings of the 26th IASTED International Conference on Artificial Intelligence and Applications
IROS'09 Proceedings of the 2009 IEEE/RSJ international conference on Intelligent robots and systems
Lattice-search runtime distributions may be heavy-tailed
ILP'02 Proceedings of the 12th international conference on Inductive logic programming
Tradeoffs in the complexity of backdoor detection
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Limitations of restricted branching in clause learning
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Towards robust CNF encodings of cardinality constraints
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
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Adaptive restart strategies for conflict driven SAT solvers
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
A decision-making procedure for resolution-based SAT-solvers
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
Improvements to hybrid incremental SAT algorithms
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
Integer optimization by local search: a domain-independent approach
Integer optimization by local search: a domain-independent approach
Symmetries of Symmetry Breaking Constraints
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Diversification and intensification in parallel SAT solving
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
Restart strategies in optimization: parallel and serial cases
Parallel Computing
Boosting local search thanks to CDCL
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Journal of Automated Reasoning
An effective algorithm for and phase transitions of the directed hamiltonian cycle problem
Journal of Artificial Intelligence Research
Understanding the behavior of Solution-Guided Search for job-shop scheduling
Journal of Scheduling
Boosting distributed constraint satisfaction
Journal of Heuristics
Propelling SAT and SAT-based BMC using careset
Proceedings of the 2010 Conference on Formal Methods in Computer-Aided Design
On freezing and reactivating learnt clauses
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
Empirical study of the anatomy of modern sat solvers
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
Computers and Industrial Engineering
Domain-splitting generalized nogoods from restarts
EPIA'11 Proceedings of the 15th Portugese conference on Progress in artificial intelligence
A bayesian approach to tackling hard computational problems
UAI'01 Proceedings of the Seventeenth conference on Uncertainty 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
Randomization in constraint programming for airline planning
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Sports league scheduling: enumerative search for prob026 from CSPLib
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Efficient query processing with compiled knowledge bases
TABLEAUX'05 Proceedings of the 14th international conference on Automated Reasoning with Analytic Tableaux and Related Methods
A clause-based heuristic for SAT solvers
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
An incremental and layered procedure for the satisfiability of linear arithmetic logic
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
An approach for dynamic split strategies in constraint solving
MICAI'05 Proceedings of the 4th Mexican international conference on Advances in Artificial Intelligence
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
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
Local search for unsatisfiability
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
Adaptive enumeration strategies and metabacktracks for constraint solving
ADVIS'06 Proceedings of the 4th international conference on Advances in Information Systems
Building efficient decision procedures on top of SAT solvers
SFM'06 Proceedings of the 6th international conference on Formal Methods for the Design of Computer, Communication, and Software Systems
Efficient detection of errors in java components using random environment and restarts
TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Job shop scheduling with setup times and maximal time-lags: a simple constraint programming approach
CPAIOR'10 Proceedings of the 7th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Characterization of a new restart strategy for randomized backtrack search
CSCLP'04 Proceedings of the 2004 joint ERCIM/CoLOGNET international conference on Recent Advances in Constraints
Simultaneous SAT-Based model checking of safety properties
HVC'05 Proceedings of the First Haifa international conference on Hardware and Software Verification and Testing
NP-SPEC: an executable specification language for solving all problems in NP
Computer Languages
A case study of expressively constrainable level design automation tools for a puzzle game
Proceedings of the International Conference on the Foundations of Digital Games
On algorithm portfolios and restart strategies
Operations Research Letters
On completing three cyclically generated transversals to a latin square
Finite Fields and Their Applications
An overview of parallel SAT solving
Constraints
The community structure of SAT formulas
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
Counting-based search: branching heuristics for constraint satisfaction problems
Journal of Artificial Intelligence Research
Planning as satisfiability: Heuristics
Artificial Intelligence
The time complexity of A* with approximate heuristics on multiple-solution search spaces
Journal of Artificial Intelligence Research
On Maximum Speedup Ratio of Restart Algorithm Portfolios
INFORMS Journal on Computing
A bisimulation between DPLL(T) and a proof-search strategy for the focused sequent calculus
Proceedings of the Eighth ACM SIGPLAN international workshop on Logical frameworks & meta-languages: theory & practice
Average-case complexity of backtrack search for coloring sparse random graphs
Journal of Computer and System Sciences
Factoring out assumptions to speed up MUS extraction
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
A survey of the satisfiability-problems solving algorithms
International Journal of Advanced Intelligence Paradigms
A generalization of SAT and #SAT for robust policy evaluation
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Crowdsourcing backdoor identification for combinatorial optimization
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
| Hi-index | 0.00 |
Unpredictability in the running time of complete search procedures can often be explained by the phenomenon of "heavy-tailed cost distributions", meaning that at any time during the experiment there is a non-negligible probability of hitting a problem that requires exponentially more time to solve than any that has been encountered before (Gomes et al. 1998a). We present a general method for introducing controlled randomization into complete search algorithms. The "boosted" search methods provably eliminate heavy-tails to the right of the median. Furthermore, they can take advantage of heavy-tails to the left of the median (that is, a nonnegligible chance of very short runs) to dramatically shorten the solution time. We demonstrate speedups of several orders of magnitude for state-of-the-art complete search procedures running on hard, real-world problems.