Combining multiple heuristics online

Proceedings of the National Conference on Artificial Intelligence

Volumn 2, Issue , 2007, Pages 1197-1203

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

^a Carnegie Mellon University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AVERAGE-CASE PERFORMANCE; RANDOM SEED; RUNNING TIME; SCHEDULE OFFLINE; TRAINING DATA;

APPROXIMATION ALGORITHMS; COMPETITION; HEURISTIC ALGORITHMS; SCHEDULING;

ONLINE SYSTEMS;

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

References (8)

1. Cesa-Bianchi, N.; Lugosi, G.; and Stoltz, G. 2005. Minimizing regret with label efficient prediction. IEEE Transactions on Information Theory 51:2152-2162.
2. Feige, U.; Lovász, L.; and Tetali, P. 2004. Approximating min sum set cover. Algorithmica 40(4):219-234.
3. Gomes, C. P., and Selman, B. 2001. Algorithm portfolios. Artificial Intelligence 126:43-62.
4. Gomes, C.; Selman, B.; Crato, N.; and Kautz, H. 2000. Heavy-tailed phenomena in satisfiability and constraint satisfications problems. Journal of Automated Reasoning 24(1/2):67-100.
5. György, A., and Ottucsák, G. 2006. Adaptive routing using expert advice. The Computer Journal 49(2):180-189.
6. Huberman, B. A.; Lukose, R. M.; and Hogg, T. 1997. An economics approach to hard computational problems. Science 275:51-54.
7. rd International Symposium on Theoretical Aspects of Computer Science, 242-253.
8. Streeter, M.; Golovin, D.; and Smith, S. F. 2007. Restart schedules for ensembles of problem instances. In Proceedings of the Twenty-Second Conference on Artificial Intelligence (AAAI-07).