Restart schedules for ensembles of problem instances

Proceedings of the National Conference on Artificial Intelligence

Volumn 2, Issue , 2007, Pages 1204-1210

  Streeter, Matthew ^a   Golovin, Daniel ^a   Smith, Stephen F ^a  

^a Carnegie Mellon University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

LENGTH DISTRIBUTION; OFFLINE ALGORITHMS; PROBLEM INSTANCES;

ONLINE SYSTEMS; SCHEDULING ALGORITHMS;

PROBLEM SOLVING;

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

References (12)

1. Alt, H.; Guibas, L.; Mehlhorn, K.; Karp, R.; and Wigderson, A. 1996. A method for obtaining randomized algorithms with small tail probabilities. Algorithmica 16(4/5):543-547.
2. Auer, P.; Cesa-Bianchi, N.; Freund, Y.; and Schapire, R. E. 2002. The nonstochastic multiarmed bandit problem. SIAM Journal on Computing 32(1):48-77.
3. Cesa-Bianchi, N.; Lugosi, G.; and Stoltz, G. 2005. Minimizing regret with label efficient prediction. IEEE Transactions on Information Theory 51:2152-2162.
4. Gagliolo, M., and Schmidhuber, J. 2007. Learning restart strategies. In Proceedings of the Twentieth International Joint Conference on Artificial Intelligence (IJCAI07), 792-797.
5. Gomes, C.; Selman, B.; and Kautz, H. 1998. Boosting combinatorial search through randomization. In Proceedings of the Fifteenth National Conference on Artificial Intelligence (AAAI-98), 431-437.
6. György, A., and Ottucsák, G. 2006. Adaptive routing using expert advice. The Computer Journal 49(2):180-189.
7. Hardy, G. H., and Ramanujan, S. 1918. Asymptotic formulae in combinatory analysis. Proceedings of the London Mathematical Society 17:75-115.
8. Kautz, H.; Ruan, Y.; and Horvitz, E. 2002. Dynamic restarts. In Proceedings of the Eighteenth National Conference on Artificial Intelligence, 674-681.
9. Luby, M.; Sinclair, A.; and Zuckerman, D. 1993. Optimal speedup of Las Vegas algorithms. Information Processing Letters 47:173-180.
10. Ruan, Y.; Horvitz, E.; and Kautz, H. 2002. Restart policies with dependence among runs: A dynamic programming approach. In Proceedings of the Eighth International Conference on Principles and Practice of Constraint Programming, 573-586.
11. Streeter, M.; Golovin, D.; and Smith, S. F. 2007a. Appendix B: Proof of theorem 3. Available at http://www.cs.cmu.edu/~matts/aaai07_appendixB.pdf.
12. Streeter, M.; Golovin, D.; and Smith, S. F. 2007b. Combining multiple heuristics online. In Proceedings of the Twenty-Second Conference on Artificial Intelligence (AAAI-07).