J. Audibert, R. Munos, and C. Szepesvari, Use of variance estimation in the multi-armed bandit problem, NIPS 2006 Workshop on On-line Trading of Exploration and Exploitation, 2006.
URL : https://hal.archives-ouvertes.fr/inria-00203496

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

P. Auer, N. Cesa-bianchi, and P. Fischer, Finite time analysis of the multiarmed bandit problem, Machine Learning, vol.47, issue.2/3, pp.235-256, 2002.
DOI : 10.1023/A:1013689704352

A. Auger and O. Teytaud, Continuous Lunches Are Free Plus the Design of??Optimal Optimization Algorithms, Algorithmica, vol.1, issue.1
DOI : 10.1007/s00453-008-9244-5
URL : https://hal.archives-ouvertes.fr/inria-00369788

S. Bernstein, On a modification of chebyshev's inequality and of the error formula of laplace. Original publication, Ann. Sci. Inst. Sav. Ukraine, Sect. Math, vol.1, issue.31, pp.38-49, 1924.

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

G. Chaslot, J. Hoock, F. Teytaud, and O. Teytaud, On the huge benefit of quasi-random mutations for multimodal optimization with application to grid-based tuning of neurocontrollers, ESANN, 2009.
URL : https://hal.archives-ouvertes.fr/inria-00380125

G. Chaslot, J. Saito, B. Bouzy, J. W. Uiterwijk, and H. J. Van-den-herik, Monte-Carlo Strategies for Computer Go, Proceedings of the 18th BeNeLux Conference on Artificial Intelligence, pp.83-91, 2006.

R. Coulom, Efficient Selectivity and Backup Operators in Monte-Carlo Tree Search, Proceedings of the 5th International Conference on Computers and Games, 2006.
DOI : 10.1007/978-3-540-75538-8_7
URL : https://hal.archives-ouvertes.fr/inria-00116992

D. Mesmay, F. Rimmel, A. Voronenko, Y. Püschel, and M. , Bandit-based optimization on graphs with application to library performance tuning, Proceedings of the 26th Annual International Conference on Machine Learning, ICML '09, 2009.
DOI : 10.1145/1553374.1553468
URL : https://hal.archives-ouvertes.fr/inria-00379523

S. Holm, A simple sequentially rejective multiple test procedure. scand. j. statistic, pp.65-70, 1979.

J. Hoock and O. Teytaud, Bandit-Based Genetic Programming, LLNCS, 2010.
DOI : 10.1007/978-3-642-12148-7_23
URL : https://hal.archives-ouvertes.fr/inria-00452887

J. Hsu, Multiple comparisons, theory and methods, 1996.

L. Kocsis and C. Szepesvari, Bandit based montecarlo planning, 15th European Conference on Machine Learning (ECML), pp.282-293, 2006.

C. Lee, M. Wang, G. Chaslot, J. Hoock, A. Rimmel et al., The Computational Intelligence of MoGo Revealed in Taiwan's Computer Go Tournaments, IEEE Transactions on Computational Intelligence, 2009.

V. Mnih, C. Szepesvári, and J. Audibert, Empirical Bernstein stopping, Proceedings of the 25th international conference on Machine learning, ICML '08, pp.672-679, 2008.
DOI : 10.1145/1390156.1390241
URL : https://hal.archives-ouvertes.fr/hal-00834983

V. Nannen and A. E. Eiben, Relevance estimation and value calibration of evolutionary algorithm par ameters, International Joint Conference on Artificial Intelligence (IJCAI'07), pp.975-980, 2007.

V. Nannen and A. E. Eiben, Variance reduction in meta-EDA, Proceedings of the 9th annual conference on Genetic and evolutionary computation , GECCO '07, pp.627-627, 2007.
DOI : 10.1145/1276958.1277087

D. Pantazis, T. E. Nichols, S. Baillet, and R. Leahy, A comparison of random field theory and permutation methods for the statistical analysis of MEG data, NeuroImage, vol.25, issue.2, pp.355-368, 2005.
DOI : 10.1016/j.neuroimage.2004.09.040

P. Rolet, M. Sebag, and O. Teytaud, Optimal active learning through billiards and upper confidence trees in continous domains, Proceedings of the ECML conference, 2009.

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