Directing a portfolio with learning

AAAI Workshop - Technical Report

Volumn WS-06-11, Issue , 2006, Pages 129-135

  Roberts, Mark ^a   Howe, Adele E ^a  

^a Colorado State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

PLANNING SYSTEMS; PORTFOLIO STRATEGY; RUN-TIME DISTRIBUTIONS;

ALGORITHMS; DECISION SUPPORT SYSTEMS; MATHEMATICAL MODELS; PROBLEM SOLVING; ROBUSTNESS (CONTROL SYSTEMS);

LEARNING SYSTEMS;

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

References (27)

1. Baptista, L., and Silva, J. P. M. 2000. Using randomization and learning to solve hard real-world instances of satisfiability. In Principles and Practice of Constraint Programming, 489-494.
2. Beck, J. C., and Freuder, E. C. 2004. Simple rules for low-knowledge algorithm selection. In Proc. of 1st CPAIOR.
3. Cormen, T.; Leiserson, C.; Rivest, R.; and Stein, C. 2003. Introduction to Algorithms. MIT press, Cambridge, MA, second edition.
4. Fink, E. 1998. How to solve it automatically: Selection among problem solving methods. In Proc. of 4th AIPS, 128-136.
5. Gebruers, C.; Guerri, A.; Hnich, B.; and Milano, M. 2004. Making choices using structure at the instance level within a case based reasoning framework. In CPAIOR, 380-386.
6. Gebruers, C.; Hnich, B.; Bridge, D. G.; and Freuder, E. C. 2005. Using CBR to select solution strategies in constraint programming. In ICCBR, 222-236.
7. Ghallab, M.; Howe, A.; Knoblock, C.; McDermott, D.; Ram, A.; Veloso, M.; Weld, D.; and Wilkins., D. 1998. PDDL : the planning domain defnition language. Technical report, Yale Center for Computational Vision and Control.
8. Gomes, C. P., and Selman, B. 1997. Algorithm portfolio design: Theory vs. practice. In Proc. of 13th UAI. Linz, Austria.: Morgan Kaufman.
9. Gratch, J., and Chien, S. 1996. Adaptive problem-solving for large-scale scheduling problems: A case study. JAIR 4:365-396.
10. Guerri, A., and Milano, M. 2004. Learning techniques for automatic algorithm portfolio selection. In Proc. of 16th ECAI, 475-479.
11. Guo, H., and Hsu, W. H. 2004. A learning-based algorithm selection meta-reasoner for the real-time mpe problem. In Australian Conference on Artificial Intelligence, 307-318.
12. Hoffmann, J. 2001. Local search topology in planning benchmarks: An empirical analysis. In Proc. of 17th IJCAI, 453-458.
13. Hoffmann, J. 2004. Utilizing Problem Structure in Planning: A local Search Approach. Berlin, New York: Springer-Verlag.
14. Horvitz, E.; Ruan, Y.; Gomes, C. P.; Kautz, H.; Selman, B.; and Chickering, D. M. 2001. A bayesian approach to tackling hard computational problems. In Proc. of 17th UAI, 235-244.
15. Howe, A. E.; Dahlman, E.; Hansen, C.; von Mayrhauser, A.; and Scheetz, M. 1999. Exploiting competitive planner performance. In P roc. of 5th ECP.
16. Huberman, B. A.; Lukose, R. M.; and Hogg, T. 1997. An economics approach to hard combinatorial problems. Science 275:51-54.
17. Lagoudakis, M. G., and Littman, M. L. 2000. Algorithm selection using reinforcement learning. In Proc. 17th ICML, 511-518.
18. Lagoudakis, M. G., and Littman, M. L. 2001. Learning to select branching rules in the dpll procedure for satisfiability. In LICS 2001 Workshop on Theory and Applications of Satisfiability Testing (SAT 2001). Boston, MA: Electronic Notes in Discrete Mathematics (ENDM), Vol. 9,.
19. Leyton-Brown, K.; Nudelman, E.; Andrew, G.; McFadden, J.; and Shoham, Y. 2003a. Boosting as a metaphore for algorithm design. In Proc. of CP.
20. Leyton-Brown, K.; Nudelman, E.; Andrew, G.; McFadden, J.; and Shoham, Y. 2003b. A portfolio approach to algorithm selection. In Proc. of 18th IJCAI.
21. Leyton-Brown, K.; Nudelman, E.; and Shoham, Y. 2002. Learning the empirical hardness of optimization problems: the case of combinatorial auctions. In Principles and Practices of Constraint Programming (CP-2002).
22. Minton, S. 1996. Automatically configuring constraint satisfaction programs: A case study. Constraints 1(1/2):7-43.
23. Nudelman, E.; Leyton-Brown, K.; Hoos, H.; Devkar, A.; and Shoham, Y. 2004. Understanding random sat: Beyond the clauses-to-variables ratio. In Priciples and Practices of Constraint Programing (CP-2004).
24. Rice, J. R. 1976. The algorithm selection problem. Advances in Computers 15:65-118.
25. Simon, H., and Kadan, J. 1975. Optimal problem-solving search: All-or-none solutions. Artificial Intelligence 6:236-247.
26. Witten, I. H., and Frank, E. 2005. Data Mining: Practical machine learning tools and techniques. Number ISBN 0-12-088407-0. San Francisco: Morgan Kaufmann, 2nd edition.
27. Wolpert, D. H., and Macready, W. G. 1997. No free lunch theorems for optimization. IEEE Transactions on Evolutionary Computation 1(1):67-82.