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

S. P. Asprey and S. Macchietto, Statistical tools for optimal dynamic model building, Computers & Chemical Engineering, vol.24, issue.2-7, pp.2017-1261, 2000.
DOI : 10.1016/S0098-1354(00)00328-8

P. Baldi and G. W. Hatfield, DNA microarrays and gene expression: from experiments to data analysis and modeling, 2002.
DOI : 10.1017/CBO9780511541773

S. Bandara, J. P. Schlöder, R. Eils, H. G. Bock, and T. Meyer, Optimal Experimental Design for Parameter Estimation of a Cell Signaling Model, PLoS Computational Biology, vol.2, issue.2, p.1000558, 2009.
DOI : 10.1371/journal.pcbi.1000558.s005

W. J. Blot and D. A. Meeter, Sequential Experimental Design Procedures, Journal of the American Statistical Association, vol.27, issue.3, p.343, 1973.
DOI : 10.1080/01621459.1973.10481388

C. B. Browne, E. Powley, D. Whitehouse, S. M. Lucas, P. I. Cowling et al., A Survey of Monte Carlo Tree Search Methods, IEEE Transactions on Computational Intelligence and AI in Games, vol.4, issue.1, pp.1-49, 2012.
DOI : 10.1109/TCIAIG.2012.2186810

O. Cappé, A. Garivier, and O. A. Maillard, Kullback???Leibler upper confidence bounds for optimal sequential allocation, The Annals of Statistics, vol.41, issue.3, pp.1-56, 2012.
DOI : 10.1214/13-AOS1119SUPP

P. A. Coquelin and R. Munos, Bandit algorithms for tree search, Proc. of Int, 2007.
URL : https://hal.archives-ouvertes.fr/inria-00150207

K. Chaloner and I. Verdinelli, Bayesian Experimental Design: A Review, Statistical Science, vol.10, issue.3, pp.273-304, 1995.
DOI : 10.1214/ss/1177009939

I. C. Chou and E. O. Voit, Recent developments in parameter estimation and structure identification of biochemical and genomic systems, Mathematical Biosciences, vol.219, issue.2, pp.57-83, 2009.
DOI : 10.1016/j.mbs.2009.03.002

D. Cohn, L. Atlas, and R. Ladner, Improving generalization with active learning, Machine Learning, vol.27, issue.4, pp.201-221, 1994.
DOI : 10.1007/BF00993277

S. Dasgupta, Analysis of a greedy active learning strategy, pp.337-344, 2005.

S. Hanneke, A bound on the label complexity of agnostic active learning, Proceedings of the 24th international conference on Machine learning, ICML '07, pp.353-360, 2007.
DOI : 10.1145/1273496.1273541

G. Franceschini and S. Macchietto, Model-based design of experiments for parameter precision: State of the art, Chemical Engineering Science, vol.63, issue.19, pp.4846-4872, 2008.
DOI : 10.1016/j.ces.2007.11.034

R. N. Gutenkunst, J. J. Waterfall, F. P. Casey, K. S. Brown, C. R. Myers et al., Universally sloppy parameter sensitivities in systems biology models, PLoS Computational Biology, issue.10, pp.1871-1878, 2007.

E. Kaufmann, O. Cappé, and A. Garivier, On bayesian upper confidence bounds for bandit problems, Proc. AISTATS, JMLR W&CP, pp.592-600, 2012.

A. Garivier and O. Cappé, The KL-UCB Algorithm for bounded stochastic bandits and beyond, In: COLT, 2011.

R. D. King, K. E. Whelan, F. M. Jones, P. G. Reiser, C. H. Bryant et al., Functional genomic hypothesis generation and experimentation by a robot scientist, Nature, vol.427, issue.6971, pp.247-252, 2004.
DOI : 10.1038/nature02236