A. Auger, M. Schoenauer, and O. Teytaud, Local and global order 3/2 convergence of a surrogate evolutionary algorithm, Proceedings of the 2005 conference on Genetic and evolutionary computation , GECCO '05, pp.857-864, 2005.
DOI : 10.1145/1068009.1068154

R. Bellman, Dynamic Programming, 1957.

D. Bertsekas, Dynamic Programming and Optimal Control, Athena Scientific, 1995.

P. Billingsley, Probability and Measure, 1986.

A. Booker, J. E. Jr, P. Dennis, D. Frank, V. Serafini et al., A rigorous framework for optimization of expensive functions by surrogates, Structural Optimization, vol.16, issue.1, pp.1-13, 1999.
DOI : 10.1007/BF01197708

A. Conn, K. Scheinberg, and L. Toint, Recent progress in unconstrained nonlinear optimization without derivatives, Mathematical Programming, pp.397-414, 1997.
DOI : 10.1007/BF02614326

D. W. Corne and J. D. Knowles, Some multiobjective optimizers are better than others, The 2003 Congress on Evolutionary Computation, 2003. CEC '03., pp.2506-2512, 2003.
DOI : 10.1109/CEC.2003.1299403

J. C. Culberson, On the Futility of Blind Search: An Algorithmic View of ???No Free Lunch???, Evolutionary Computation, vol.18, issue.3, pp.109-127, 1998.
DOI : 10.1109/4235.585893

J. Dennis and V. Torczon, Managing approximation models in optimization, Multidisciplinary Design Optimization: State of the Art, pp.330-347, 1997.

J. Doob, Stochastic process measurability conditions, Annales de l???institut Fourier, vol.25, issue.3-4, pp.163-176, 1975.
DOI : 10.5802/aif.577

S. Droste, T. Jansen, and I. Wegener, Perhaps not a free lunch but at least a free appetizer, Proceedings of the Genetic and Evolutionary Computation Conference(GECCO 99), pp.833-839, 1999.

S. Droste, T. Jansen, and I. Wegener, Optimization with randomized search heuristics???the (A)NFL theorem, realistic scenarios, and difficult functions, Theoretical Computer Science, vol.287, issue.1, pp.131-144, 2002.
DOI : 10.1016/S0304-3975(02)00094-4

S. Gelly, J. B. Hoock, A. Rimmel, O. Teytaud, and Y. Kalemkarian, The parallelization of monte-carlo planning, Proceedings of the International Conference on Informatics in Control, Automation and Robotics, pp.198-203, 2008.
URL : https://hal.archives-ouvertes.fr/inria-00287867

S. Gelly, S. Ruette, and O. Teytaud, Comparison-Based Algorithms Are Robust and Randomized Algorithms Are Anytime, Evolutionary Computation, vol.26, issue.3, pp.411-434, 2007.
DOI : 10.1137/0801010
URL : https://hal.archives-ouvertes.fr/inria-00173221

S. Gelly and D. Silver, Combining online and offline knowledge in UCT, Proceedings of the 24th international conference on Machine learning, ICML '07, pp.273-280, 2007.
DOI : 10.1145/1273496.1273531
URL : https://hal.archives-ouvertes.fr/inria-00164003

S. Gelly, O. Teytaud, and C. Gagné, Resource-Aware Parameterizations of EDA, 2006 IEEE International Conference on Evolutionary Computation, pp.2506-2512, 2006.
DOI : 10.1109/CEC.2006.1688620
URL : https://hal.archives-ouvertes.fr/inria-00112803

D. Geman and B. Jedynak, An active testing model for tracking roads in satellite images, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.18, issue.1, pp.1-14, 1996.
DOI : 10.1109/34.476006
URL : https://hal.archives-ouvertes.fr/inria-00073935

M. V. Grieken, Optimisation pour l'apprentissage et apprentissage pour l'optimisation, 2004.
URL : https://hal.archives-ouvertes.fr/tel-00010106

N. Hansen and A. Ostermeier, Completely Derandomized Self-Adaptation in Evolution Strategies, Evolutionary Computation, vol.9, issue.2, pp.159-195, 2001.
DOI : 10.1016/0004-3702(95)00124-7

D. Hopkins, T. Lavelle, and S. Patnaik, Neural network and regression methods demonstrated in the design optimization of a subsonic aircraft, 2002.

M. Husken, Y. Jin, and B. Sendhoff, Structure optimization of neural networks for evolutionary design optimization, Soft Computing, vol.9, issue.1, pp.21-28, 2005.
DOI : 10.1007/s00500-003-0330-y

S. Ibric, M. Jovanovic, Z. Djuric, J. Parojcic, S. Petrovic et al., Artificial neural networks in the modeling and optimization of aspirin extended release tablets with eudragit L 100 as matrix substance, AAPS PharmSciTech, vol.4, issue.1, pp.62-70, 2003.
DOI : 10.1208/pt040109

C. Igel and M. Toussaint, A No-Free-Lunch theorem for non-uniform distributions of target functions, Journal of Mathematical Modelling and Algorithms, vol.1, issue.(1), pp.313-322, 2004.
DOI : 10.1007/s10852-005-2586-y

D. R. Jones, M. Schonlau, and W. J. Welch, Efficient global optimization of expensive black-box functions, Journal of Global Optimization, vol.13, issue.4, pp.455-492, 1998.
DOI : 10.1023/A:1008306431147

A. Keane and P. Nair, Computational Approaches for Aerospace Design : The Pursuit of Excellence, 2005.
DOI : 10.1002/0470855487

S. Kern, N. Hansen, and P. Koumoutsakos, Local Meta-models for Optimization Using Evolution Strategies, Proceedings of the Parallel Problems Solving from Nature conference, pp.939-948, 2006.
DOI : 10.1007/11844297_95

J. Kleijnen, Sensitivity analysis of simulation experiments: regression analysis and statistical design, Mathematics and Computers in Simulation, vol.34, issue.3-4, pp.297-315, 1992.
DOI : 10.1016/0378-4754(92)90007-4

L. Kocsis and C. Szepesvari, Bandit Based Monte-Carlo Planning, European Conference on Machine Learning, pp.282-293, 2006.
DOI : 10.1007/11871842_29

A. Kolmogorov, Foundations of the theory of Probability (original: Grundbegriffe der Wahrscheinlichkeitsrechnung) Chelsea publishing company, 1933.

S. J. Leary, A. Bhaskar, and A. J. Keane, A Derivative Based Surrogate Model for Approximating and Optimizing the Output of an Expensive Computer Simulation, Journal of Global Optimization, vol.30, issue.1, pp.39-58, 2004.
DOI : 10.1023/B:JOGO.0000049094.73665.7e

P. Poupart, N. Vlassis, J. Hoey, and K. Regan, An analytic solution to discrete Bayesian reinforcement learning, Proceedings of the 23rd international conference on Machine learning , ICML '06, pp.697-704, 2006.
DOI : 10.1145/1143844.1143932

M. J. Powell, Unconstrained minimization algorithms without computation of derivatives, Bollettino della Unione Matematica Italiana, vol.9, pp.60-69, 1974.

. Ames-research and . Center, Aerodynamic design using neural networks, the amount of computation needed to optimize a design is reduced, 2003.

N. Radcliffe and P. Surry, Fundamental limitations on search algorithms: Evolutionary computing in perspective, pp.275-291, 1995.
DOI : 10.1007/BFb0015249

T. Runarsson, Ordinal Regression in Evolutionary Computation, Proceedings of the Parallel Problems Solving from Nature conference, pp.1048-1057, 2006.
DOI : 10.1007/11844297_106

C. Schumacher, M. D. Vose, and L. D. Whitley, The No Free Lunch and Problem Description Length, Genetic and Evolutionary Computation Conference, pp.565-570, 2001.

E. Vanmarcke, Random Fields: Analysis & Synthesis, Journal of Vibration Acoustics Stress and Reliability in Design, vol.107, issue.2, 1998.
DOI : 10.1115/1.3269255

J. Villemonteix, E. Vazquez, and E. Walter, An informational approach to the global optimization of expensive-to-evaluate functions, Journal of Global Optimization, vol.10, issue.5
DOI : 10.1007/s10898-008-9354-2
URL : https://hal.archives-ouvertes.fr/hal-00354262

Y. Wang and S. Gelly, Modifications of UCT and sequence-like simulations for Monte-Carlo Go, 2007 IEEE Symposium on Computational Intelligence and Games, pp.175-182, 2007.
DOI : 10.1109/CIG.2007.368095

D. Wolpert and W. Macready, No free lunch theorems for optimization, IEEE Transactions on Evolutionary Computation, vol.1, issue.1, pp.67-82, 1997.
DOI : 10.1109/4235.585893