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

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

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. Xu, F. Hutter, H. H. Hoos, and K. Leyton-brown, Hydra-mip: automated algorithm configuration and selection for mixed integer programming, RCRA Workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion at the International Joint Conference on Artificial Intelligence (IJCAI), 2011.

L. Kotthoff, Algorithm Selection for Combinatorial Search Problems: A Survey, 1210.
DOI : 10.1007/978-3-642-31612-8_18

R. Gaudel, J. Hoock, J. Pérez, N. Sokolovska, and O. Teytaud, A Principled Method for Exploiting Opening Books, Computers and Games, pp.136-144, 2011.
DOI : 10.1007/978-3-642-17928-0_13
URL : https://hal.archives-ouvertes.fr/inria-00484043

B. Bouzy, M. Métivier, and D. Pellier, Hedging algorithms and repeated matrix games, ECML Workshop on Machine Learning and Data Mining In and Around Games, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00975943

M. Swiechowski and J. Mandziuk, Self-Adaptation of Playing Strategies in General Game Playing, IEEE Transactions on Computational Intelligence and AI in Games, vol.6, issue.4, p.2014
DOI : 10.1109/TCIAIG.2013.2275163

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

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

L. Xu, F. Hutter, H. H. Hoos, and K. Leyton-brown, Satzilla: Portfoliobased algorithm selection for sat, J. Artif. Intell. Res.(JAIR), vol.32, pp.565-606, 2008.

S. Teraoka, T. Ushio, and T. Kanazawa, Voronoi coverage control with time-driven communication for mobile sensing networks with obstacles, IEEE Conference on Decision and Control and European Control Conference, pp.1980-1985, 2011.
DOI : 10.1109/CDC.2011.6160574

O. Lejri and M. Tagina, Representation in case-based reasoning applied to control reconfiguration Applications and Theoretical Aspects, ser. Lecture Notes in Computer Science, P. Perner, Advances in Data Mining, pp.113-120

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

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

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

J. Nash, K. Gale, and T. , Some games and machines for playing them Rand Corporation , Tech. Rep. D-1164 Linear programming and the theory of games, Activity Analysis of Production and Allocation, Koopmans, 1951.

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

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

J. Paredis, Coevolutionary Computation, Artificial Life, vol.3, issue.4, pp.355-375, 1995.
DOI : 10.1007/BF00203032

C. Ong, H. Quek, K. Tan, and A. Tay, Discovering Chinese Chess Strategies through Coevolutionary Approaches, 2007 IEEE Symposium on Computational Intelligence and Games, pp.360-367, 2007.
DOI : 10.1109/CIG.2007.368121

P. Drake and Y. Chen, Coevolving partial strategies for the game of go, International Conference on Genetic and Evolutionary Methods, 2008.

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

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

P. Auer, N. Cesa-bianchi, and P. Fischer, Finite time analysis of the multiarmed bandit problem, Machine Learning, pp.235-256, 2002.

J. Audibert, R. Munos, and C. Szepesvri, Exploration-exploitation trade-off using variance estimates in multi-armed bandits, Theoretical Computer Science, 2008.

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

B. Robertie, Backgammon Inside Backgammon, p.4, 1980.