Adaptive online time allocation to search algorithms

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 3201, Issue , 2004, Pages 134-143

  Gagliolo, Matteo ^a   Zhumatiy, Viktor ^a   Schmidhuber, Jürgen ^a  

^a DALLE MOLLE INSTITUTE FOR ARTIFICIAL INTELLIGENCE IDSIA   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; COMPUTER PROGRAMMING LANGUAGES; GENETIC ALGORITHMS; HEURISTIC METHODS; PROBABILITY DISTRIBUTIONS; PROBLEM SOLVING; ARTIFICIAL INTELLIGENCE; LEARNING ALGORITHMS; LEARNING SYSTEMS;

ADAPTIVE ONLINE TIME ALLOCATOR (AOTA); BIAS-OPTIMAL FASHION; MUTATION; SEARCH ALGORITHMS; COMPUTATION TIME; LINEAR EXTRAPOLATION; ONLINE TIME; ORDERS OF MAGNITUDE; SEARCH PROBLEM; STATE OF THE ART;

ONLINE SEARCHING; ALGORITHMS;

EID: 22944468811     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-30115-8_15     Document Type: Conference Paper

References (16)

1. M. Birattari, T. Stützle, L. Paquete, and K. Varrentrapp. A racing algorithm for configuring metaheuristics. In W. Langdon et al., editor, GECCO 2002: Proceedings of the Genetic and Evolutionary Computation Conference, pages 11-18. Morgan Kaufmann Publishers, 2002.
2. B. Freisleben and P. Merz. New Genetic Local Search Operators for the Traveling Salesman Problem. In H.-M. Voigt, W. Ebeling, I. Rechenberg, and H.-P. Schwefel, editors, Parallel Problem Solving from Nature IV, volume 1141 of Lecture Notes in Computer Science, pages 890-900. Springer, 1996.
3. J. Fürnkranz, J. Petrak, P. Brazdil, and C. Soares. On the use of fast subsampling estimates for algorithm recommendation. Technical Report TR-2002-36, Österreichisches Forschungsinstitut für Artificial Intelligence, Wien, 2002.
4. E. S. Gardner Jr. Exponential smoothing: the state of the art. Journal of Forecasting, 4:1-28, 1985.
5. G. R. Harick and F. G. Lobo. A parameter-less genetic algorithm. In Wolfgang Banzhaf, Jason Daida, Agoston E. Eiben, Max H. Garzon, Vasant Honavar, Mark Jakiela, and Robert E. Smith, editors, Proceedings of the Genetic and Evolutionary Computation Conference, volume 2, page 1867, Orlando, Florida, USA, 13-17 July 1999. Morgan Kaufmann.
6. J. H. Holland. Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor, 1975.
7. H. H. Hoos and T. Stützle. SATLIB: An Online Resource for Research on SAT. In T. Walsh I.P.Gent, H.v.Maaren, editor, SAT2000, pages 283-292. IOS press, 2000. http://www.satlib.org.
8. L.P. Kaelbling, M.L. Littman, and A.W. Moore. Reinforcement learning: a survey. Journal of AI research, 4:237-285, 1996.
9. Alexandros Kalousis, Jo ao Gama, and Melanie Hilario. On data and algorithms: Understanding inductive performance. Mach. Learn., 54(3):275-312, 2004.
10. A. W. Moore and M. S. Lee. Efficient algorithms for minimizing cross validation error. In Proceedings of the 11th International Conference on Machine Learning, pages 190-198. Morgan Kaufmann, 1994.
11. G. Reinelt. Tsplib 95. http://www.iwr.uni-heidelberg.de/groups/ comopt/software/TSPLIB95.
12. J. Schmidhuber. Optimal ordered problem solver. Machine Learning, 54:211-254, 2004.
13. Short version in NIPS 15, p. 1571-1578, 2003.
14. Carlos Soares, Pavel B. Brazdil, and Petr Kuba. A meta-learning method to select the kernel width in support vector regression. Mach. Learn., 54(3): 195-209, 2004.
15. Ray J. Solomonoff. Progress in incremental machine learning. Technical Report IDSIA-16-03, IDSIA, 2003.
16. M. Wall. GAlib, A C++ Genetic Algorithms Library, http://lancet.mit.edu/ ga.