The max K-armed bandit: A new model of exploration applied to search heuristic selection

Proceedings of the National Conference on Artificial Intelligence

Volumn 3, Issue , 2005, Pages 1355-1361

  Cicirello, Vincent A ^a   Smith, Stephen F ^b  

^a Drexel University   (United States)

^b CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

K-ARMED BANDIT; MULTIARMED SLOT MACHINE; SEARCH HEURISTIC SELECTION; STOCHASTIC SEARCH ALGORITHMS;

ALGORITHMS; HEURISTIC METHODS; RANDOM PROCESSES; SCHEDULING;

ARTIFICIAL INTELLIGENCE;

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

References (17)

1. Agrawal, R. 1995. The continuum-armed bandit problem. SIAM Journal on Control and Optimization 33(6).
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. Auer, P.; Cesa-Bianchi, N.; Fischer, P. 2002. Finitetime analysis of the multiarmed bandit problem. Machine Learning 47.
4. Beasley, J. E. 1998. Weighted tardiness. In OR-Library. http://mscmga.ms.ic.ac.uk/jeb/orlib/wtinfo.html.
5. Berry, D. A., and Fristedt, B. 1985. Bandit Problems: Sequential Allocation of Experiments. Chapman-Hall.
6. Cesta, A; Oddi, A; and Smith, S. F. 2002. A constraint-based method for project scheduling with time windows. Journal of Heuristics 8(1).
7. Cicirello, V. A., and Smith, S. F. 2004. Heuristic selection for stochastic search optimization: Modeling solution quality by extreme value theory. The 10th Int Conf on Principles and Practice of Constraint Programming, 197-211.
8. Cicirello, V. A., and Smith, S. F. 2005. Enhancing stochastic search performance by value-biased randomization of heuristics. Journal of Heuristics 11(1). Forthcoming.
9. Coles, S. 2001. An Introduction to Statistical Modeling of Extreme Values. Springer-Verlag.
10. Congram, R. K.; Potts, C. N.; and van de Velde, S. L. 2002. An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem. INFORMS Journal on Computing 14(1):52-67.
11. Franck, B.; Neumann, K.; and Schwindt, C. 2001. Truncated branch-and-bound, schedule-construction, and schedule-improvement procedures for resource-constrained project scheduling. OR Spektrum 23:297-324.
12. Holland, J. H. 1975. Adaptation in Natural and Artificial Systems.
13. Morton, T. E., and Pentico, D. W. 1993. Heuristic Scheduling Systems. John Wiley and Sons.
14. NIST/SEMATECH. 2003. e-Handbook of Statistical Methods. http://www.itl.nist.gov/div898/handbook/.
15. Schwindt, C. 2003. http://www.wior.uni-karlsruhe.de/LS_Neumann/Forschung/ ProGenMax/rcpspmax.html.
16. Smith, T. B., and Pyle, J. M. 2004. An effective algorithm for project scheduling with arbitrary temporal constraints. AAAI'04.
17. Sutton, R. S., and Barto, A. G. 1998. Reinforcement Learning: An Introduction. Cambridge, MA: MIT Press.