New techniques for algorithm portfolio design

Proceedings of the 24th Conference on Uncertainty in Artificial Intelligence, UAI 2008

Volumn , Issue , 2008, Pages 519-527

  Streeter, Matthew ^a   Smith, Stephen F ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

STATE-OF-THE-ART ALGORITHMS; ZERO-ONE;

ARTIFICIAL INTELLIGENCE; INTEGER PROGRAMMING;

ALGORITHMS;

EID: 77958571237     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. Fadi A. Aloul, Arathi Ramani, Igor L. Markov, and Karem A. Sakallah. Generic ILP versus specialized 0-1 ILP: An update. In ICCAD, pages 450-457, 2002.
2. Avrim Blum and Yishay Mansour. From external to internal regret. Journal of Machine Learning Research, 8:1307-1324, 2007. (Pubitemid 47143711)
3. Uriel Feige, László Lovász, and Prasad Tetali. Approximating min sum set cover. Algorithmica, 40(4):219-234, 2004. (Pubitemid 40871638)
4. Matteo Gagliolo and Jürgen Schmidhuber. Dynamic algorithm portfolios. In AIMATH, 2006.
5. Carla P. Gomes and Bart Selman. Algorithm portfolio design: Theory vs. practice. In UAI, pages 190-197, 1997.
6. Carla P. Gomes and Bart Selman. Algorithm portfolios. Artificial Intelligence, 126:43-62, 2001. (Pubitemid 32196231)
7. Carla P. Gomes, Bart Selman, and Henry Kautz. Boosting combinatorial search through randomization. In AAAI, pages 431-437, 1998.
8. Bernardo A. Huberman, Rajan M. Lukose, and Tad Hogg. An economics approach to hard computational problems. Science, 275:51-54, 1997. (Pubitemid 27020302)
9. Ming-Yang Kao, Yuan Ma, Michael Sipser, and Yiqun Yin. Optimal constructions of hybrid algorithms. In SODA, pages 372-381, 1994.
10. Kevin Leyton-Brown, Eugene Nudelman, Galen Andrew, James McFadden, and Yoav Shoham. Boosting as a metaphor for algorithm design. In CP, pages 899-903, 2003.
11. Michael Luby, Alistair Sinclair, and David Zuckerman. Optimal speedup of Las Vegas algorithms. Information Processing Letters, 47:173-180, 1993.
12. Marek Petrik and Shlomo Zilberstein. Learning parallel portfolios of algorithms. Annals of Mathematics and Artificial Intelligence, 48(1-2):85-106, 2006.
13. Tzur Sayag, Shai Fine, and Yishay Mansour. Combining multiple heuristics. In STACS, pages 242-253, 2006. (Pubitemid 43990430)
14. Matthew Streeter. Using Online Algorithms to Solve NP-Hard Problems More Efficiently in Practice. PhD thesis, Carnegie Mellon University, 2007.
15. Matthew Streeter and Daniel Golovin. An online algorithm for maximizing submodular functions. Technical Report CMU-CS-07-171, Carnegie Mellon University, 2007.
16. Matthew Streeter, Daniel Golovin, and Stephen F. Smith. Combining multiple heuristics online. In AAAI, pages 1197-1203, 2007. (Pubitemid 350149731)
17. Matthew Streeter, Daniel Golovin, and Stephen F. Smith. Restart schedules for ensembles of problem instances. In AAAI, pages 1204-1210, 2007. (Pubitemid 350149732)
18. Lin Xu, Frank Hutter, Holger H. Hoos, and Kevin Leyton-Brown. SATzilla07: The design and analysis of an algorithm portfolio for SAT. In CP, pages 712-727, 2007.