D. W. Aha, Generalizing from Case Studies: A Case Study, Proceedings of the 9th International Workshop on Machine Learning, pp.1-10, 1992.
DOI : 10.1016/B978-1-55860-247-2.50006-1

W. Armstrong, P. Christen, E. Mccreath, and A. P. , Dynamic Algorithm Selection Using Reinforcement Learning, 2006 International Workshop on Integrating AI and Data Mining, pp.18-25, 2006.
DOI : 10.1109/AIDM.2006.4
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.62.8228

D. V. Arnold and H. Beyer, A general noise model and its effects on evolution strategy performance, IEEE Transactions on Evolutionary Computation, vol.10, issue.4, pp.380-391, 2006.
DOI : 10.1109/TEVC.2005.859467

P. Auer, Using confidence bounds for exploitation-exploration trade-offs, The Journal of Machine Learning Research, vol.3, pp.397-422, 2003.

P. Auer, N. Cesa-bianchi, Y. Freund, and R. E. Schapire, Gambling in a rigged casino: The adversarial multi-armed bandit problem, Proceedings of IEEE 36th Annual Foundations of Computer Science, pp.322-331, 1995.
DOI : 10.1109/SFCS.1995.492488

H. Beyer, The Theory of Evolutions Strategies, 2001.
DOI : 10.1007/978-3-662-04378-3

J. Borrett, E. P. Tsang, and C. C. Sq, Towards a formal framework for comparing constraint satisfaction problem formulations, 1996.

S. Bubeck, R. Munos, and G. Stoltz, Pure Exploration in Multi-armed Bandits Problems, ALT, pp.23-37, 2009.
DOI : 10.1090/S0002-9904-1952-09620-8

H. Chen, Lower Rate of Convergence for Locating a Maximum of a Function, The Annals of Statistics, vol.16, issue.3, pp.1330-1334, 1988.
DOI : 10.1214/aos/1176350965

V. A. Cicirello and S. F. Smith, The max k-armed bandit: A new model of exploration applied to search heuristic selection, Proceedings of the 20th National Conference on Artificial Intelligence, pp.1355-1361, 2005.

A. Conn, K. Scheinberg, and L. Toint, Recent progress in unconstrained nonlinear optimization without derivatives, Mathematical Programming, vol.12, issue.1, 1997.
DOI : 10.1007/BF02614326

V. Fabian, Stochastic Approximation of Minima with Improved Asymptotic Speed, The Annals of Mathematical Statistics, vol.38, issue.1, pp.191-200, 1967.
DOI : 10.1214/aoms/1177699070

V. Fabian, Stochastic Approximation. SLP. Department of Statistics and Probability, 1971.

M. Gagliolo and J. Schmidhuber, A neural network model for inter-problem adaptive online time allocation, 15th International Conference on Arti cial Neural Networks: Formal Models and Their Applications, pp.7-12, 2005.

M. Gagliolo and J. Schmidhuber, Learning dynamic algorithm portfolios, Annals of Mathematics and Artificial Intelligence, vol.18, issue.2, pp.295-328, 2006.
DOI : 10.1007/s10472-006-9036-z

M. D. Grigoriadis and L. G. Khachiyan, A sublinear-time randomized approximation algorithm for matrix games, Operations Research Letters, vol.18, issue.2, pp.53-58, 1995.
DOI : 10.1016/0167-6377(95)00032-0

Y. Hamadi, Search: from Algorithms to Systems, 2013.

E. Horvitz, Y. Ruan, C. P. Gomes, H. A. Kautz, B. Selman et al., A bayesian approach to tackling hard computational problems, Proceedings of the 17th Conference in Uncertainty in Artificial Intelligence, pp.235-244

M. Jebalia, A. Auger, and N. Hansen, Log-Linear Convergence and Divergence of??the??Scale-Invariant (1+1)-ES in Noisy Environments, Algorithmica, vol.13, issue.1, pp.1-36, 2010.
DOI : 10.1007/s00453-010-9403-3
URL : https://hal.archives-ouvertes.fr/inria-00433347

Y. Jin and J. Branke, Evolutionary Optimization in Uncertain Environments???A Survey, ieee transactions on evolutionary computation, pp.303-317, 2005.
DOI : 10.1109/TEVC.2005.846356

S. Kadioglu, Y. Malitsky, A. Sabharwal, H. Samulowitz, and M. Sellmann, Algorithm Selection and Scheduling, 17th International Conference on Principles and Practice of Constraint Programming, pp.454-469, 2011.
DOI : 10.1007/978-3-642-23786-7_35

L. Kocsis and C. Szepesvari, Discounted-ucb, 2nd Pascal-Challenge Workshop, 2006.

L. Kotthoff, Algorithm selection for combinatorial search problems: A survey. CoRR, abs, 1210.

T. Lai and H. Robbins, Asymptotically efficient adaptive allocation rules, Advances in Applied Mathematics, vol.6, issue.1, pp.4-22, 1985.
DOI : 10.1016/0196-8858(85)90002-8

E. Nudelman, K. Leyton-brown, H. H. Hoos, A. Devkar, and Y. Shoham, Understanding Random SAT: Beyond the Clauses-to-Variables Ratio, Principles and Practice of Constraint Programming CP 2004, pp.438-452, 2004.
DOI : 10.1007/978-3-540-30201-8_33

L. Pulina and A. Tacchella, A self-adaptive multi-engine solver for quantified Boolean formulas, Constraints, vol.2, issue.1, pp.80-116, 2009.
DOI : 10.1007/s10601-008-9051-2

H. Samulowitz and R. Memisevic, Learning to solve qbf, Proceedings of the 22nd National Conference on Artificial Intelligence, pp.255-260, 2007.

B. Sendhoff, H. Beyer, and M. Olhofer, The influence of stochastic quality functions on evolutionary search, in recent advances in simulated evolution and learning, ser. advances in natural computation, pp.152-172, 2004.

O. Shamir, On the complexity of bandit and derivative-free stochastic convex optimization. CoRR, abs, 1209.

M. J. Streeter, D. Golovin, and S. F. Smith, Restart schedules for ensembles of problem instances, pp.1204-1210, 2007.

R. S. Sutton and A. G. Barto, Reinforcement Learning: An Introduction, IEEE Transactions on Neural Networks, vol.9, issue.5, 1998.
DOI : 10.1109/TNN.1998.712192

P. E. Utgoff, Perceptron Trees: A Case Study in Hybrid Concept Representations, National Conference on Artificial Intelligence, pp.601-606, 1988.
DOI : 10.1023/A:1022699900025

V. Vassilevska, R. Williams, and S. L. Woo, Confronting hardness using a hybrid approach, Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm , SODA '06, pp.1-10, 2006.
DOI : 10.1145/1109557.1109558