Linear network optimization: algorithms and codes
Linear network optimization: algorithms and codes
Branch and bound algorithm selection by performance prediction
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Artificial Intelligence - special issue on computational tradeoffs under bounded resources
A Bayesian Approach to Tackling Hard Computational Problems
UAI '01 Proceedings of the 17th Conference in Uncertainty in Artificial Intelligence
Learning the Empirical Hardness of Optimization Problems: The Case of Combinatorial Auctions
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Sparse Multinomial Logistic Regression: Fast Algorithms and Generalization Bounds
IEEE Transactions on Pattern Analysis and Machine Intelligence
Learning dynamic algorithm portfolios
Annals of Mathematics and Artificial Intelligence
A portfolio approach to algorithm select
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
A backbone-search heuristic for efficient solving of hard 3-SAT formulae
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Hierarchical hardness models for SAT
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
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
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
Zchaff2004: an efficient SAT solver
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
Using CBR to select solution strategies in constraint programming
ICCBR'05 Proceedings of the 6th international conference on Case-Based Reasoning Research and Development
Switching among Non-Weighting, Clause Weighting, and Variable Weighting in Local Search for SAT
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Cross-disciplinary perspectives on meta-learning for algorithm selection
ACM Computing Surveys (CSUR)
Using Cost Distributions to Guide Weight Decay in Local Search for SAT
PRICAI '08 Proceedings of the 10th Pacific Rim International Conference on Artificial Intelligence: Trends in Artificial Intelligence
Empirical hardness models: Methodology and a case study on combinatorial auctions
Journal of the ACM (JACM)
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Instance-Based Selection of Policies for SAT Solvers
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
SATzilla: portfolio-based algorithm selection for SAT
Journal of Artificial Intelligence Research
Hierarchical hardness models for SAT
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Improvements to hybrid incremental SAT algorithms
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
Practical performance models of algorithms in evolutionary program induction and other domains
Artificial Intelligence
Understanding TSP difficulty by learning from evolved instances
LION'10 Proceedings of the 4th international conference on Learning and intelligent optimization
Journal of Automated Reasoning
Boosting distributed constraint satisfaction
Journal of Heuristics
Optimization of heuristic search using recursive algorithm selection and reinforcement learning
Annals of Mathematics and Artificial Intelligence
Review: Measuring instance difficulty for combinatorial optimization problems
Computers and Operations Research
Algorithm selection and scheduling
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Algorithm portfolio selection as a bandit problem with unbounded losses
Annals of Mathematics and Artificial Intelligence
Discovering the suitability of optimisation algorithms by learning from evolved instances
Annals of Mathematics and Artificial Intelligence
Learning algorithm portfolios for parallel execution
LION'12 Proceedings of the 6th international conference on Learning and Intelligent Optimization
Models of performance of time series forecasters
Neurocomputing
Algorithm runtime prediction: Methods & evaluation
Artificial Intelligence
Towards objective measures of algorithm performance across instance space
Computers and Operations Research
Hi-index | 0.00 |
It has been widely observed that there is no "dominant" SAT solver; instead, different solvers perform best on different instances. Rather than following the traditional approach of choosing the best solver for a given class of instances, we advocate making this decision online on a per-instance basis. Building on previous work, we describe a per-instance solver portfolio for SAT, SATzilla-07, which uses socalled empirical hardness models to choose among its constituent solvers. We leverage new model-building techniques such as censored sampling and hierarchical hardness models, and demonstrate the effectiveness of our techniques by building a portfolio of state-of-the-art SAT solvers and evaluating it on several widely-studied SAT data sets. Overall, we show that our portfolio significantly outperforms its constituent algorithms on every data set. Our approach has also proven itself to be effective in practice: in the 2007 SAT competition, SATzilla-07 won three gold medals, one silver, and one bronze; it is available online at http://www.cs.ubc.ca/labs/beta/Projects/SATzilla.