Sciweavers

JAIR
2008
103views more  JAIR 2008»
14 years 13 days ago
SATzilla: Portfolio-based Algorithm Selection for SAT
It has been widely observed that there is no single "dominant" SAT solver; instead, different solvers perform best on different instances. Rather than following the trad...
Lin Xu, Frank Hutter, Holger H. Hoos, Kevin Leyton...
CP
2007
Springer
14 years 6 months ago
Hierarchical Hardness Models for SAT
Abstract. Empirical hardness models are a recent approach for studying NP-hard problems. They predict the runtime of an instance using efficiently computable features. Previous res...
Lin Xu, Holger H. Hoos, Kevin Leyton-Brown
CP
2007
Springer
14 years 6 months ago
: The Design and Analysis of an Algorithm Portfolio for SAT
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 appr...
Lin Xu, Frank Hutter, Holger H. Hoos, Kevin Leyton...