959 search results - page 1 / 192 » New Techniques for Algorithm Portfolio Design |
UAI
2008
14 years 10 months ago
2008
We present and evaluate new techniques for designing algorithm portfolios. In our view, the problem has both a scheduling aspect and a machine learning aspect. Prior work has larg...
CP
2007
Springer
15 years 3 months ago
2007
Springer
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...
AAAI
2010
14 years 11 months ago
2010
The AI community has achieved great success in designing high-performance algorithms for hard combinatorial problems, given both considerable domain knowledge and considerable eff...
106
click to vote
SLS
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. This work presents an algorithm for the sub-graph isomorphism problem based on a new pruning technique for directed graphs. During the tree search, the method checks if a...
ECCC
2006
14 years 9 months ago
2006
We introduce a new algorithm and a new analysis technique that is applicable to a variety of online optimization scenarios, including regret minimization for Lipschitz regret func...