Selecting the Right Algorithm

AAAI Fall Symposium - Technical Report

Volumn FS-01-04, Issue , 2001, Pages 74-75

  Lagoudakis, Michail G ^a   Littman, Michael L ^b   Parr, Ronald E ^a  

^a Duke University   (United States)

^b AT AND T LABS RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (4)

1. Cormen, T. H.; Leiserson, C. E.; and Rivest, R. L. 1990.In-troduction to Algorithms. Cambridge,MA:The MIT Press.
2. Lagoudakis, M. G., and Littman, M.L. 2000. Algorithm selection using reinforcementlearning. In Langley,P., ed., Proceedingsof the Seventeenth International Conference on Machine Learning, 511-518. MorganKaufmann, San Francisco, CA.
3. Lagoudakis, M. G., and Littman, M. L. 2001. Learning to select branchingrules in the dpll procedurefor satisfiability. In Kautz, H., and Selman,B., eds., Electronic Notesin Discrete Mathematics (ENDM),Vol. 9, LICS 2001 Work-shopon Theoryand Applications of Satisfiability Testing (SAT2001). Elsevier Science.
4. Rice, J.R. 1976. The algorithm selection problem. Advances in Computers 15:65-118.