Paper Info
Title
Snappy: a simple algorithm portfolio
Abstract
Algorithm portfolios try to combine the strength of individual algorithms to tackle a problem instance at hand with the most suitable technique. In the context of SAT the effectiveness of such approaches is often demonstrated at the SAT Competitions. In this paper we show that a competitive algorithm portfolio can be designed in an extremely simple fashion. In fact, the algorithm portfolio we present does not require any offline learning nor knowledge of any complex Machine Learning tools. We hope that the utter simplicity of our approach combined with its effectiveness will make algorithm portfolios accessible by a broader range of researchers including SAT and CSP solver developers.
Year
DOI
Venue
2013
10.1007/978-3-642-39071-5_33
SAT
Keywords
Field
DocType
csp solver developer,competitive algorithm portfolio,simple fashion,complex machine,simple algorithm portfolio,problem instance,algorithm portfolio,offline learning,individual algorithm,sat competitions,broader range
Offline learning,Collaborative filtering,Computer science,Portfolio,Competitive algorithm,Artificial intelligence,Solver,SIMPLE algorithm
Conference
Citations 
PageRank 
References 
7
0.43
11
Authors
4
Name
Order
Citations
PageRank
Horst Samulowitz131626.05
Chandra Reddy21168.09
Ashish Sabharwal3106370.62
Meinolf Sellmann472848.77