T. Cazenave, Nested monte-carlo search, IJCAI, pp.456-461, 2009.
URL : https://hal.archives-ouvertes.fr/hal-01436286

R. Coulom, Efficient Selectivity and Backup Operators in Monte-Carlo Tree Search, Proceedings of the 5th international conference on Computers and games, CG'06, pp.72-83, 2007.
DOI : 10.1007/978-3-540-75538-8_7
URL : https://hal.archives-ouvertes.fr/inria-00116992

D. Defays, An efficient algorithm for a complete link method, The Computer Journal, vol.20, issue.4, pp.364-366, 1977.
DOI : 10.1093/comjnl/20.4.364

C. Dubout and F. Fleuret, Tasting families of features for image classification, 2011 International Conference on Computer Vision, pp.929-936, 2011.
DOI : 10.1109/ICCV.2011.6126335

G. Dulac-arnold, L. Denoyer, P. Preux, and P. Gallinari, Fast reinforcement learning with large action sets using errorcorrecting output codes for mdp factorization, Machine Learning and Knowledge Discovery in Databases, pp.180-194, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00747729

L. Kocsis and C. Szepesvari, Bandit Based Monte-Carlo Planning, ECML'06, pp.282-293, 2006.
DOI : 10.1007/11871842_29

A. Mcgovern, R. S. Sutton, and A. H. Fagg, Roles of macroactions in accelerating reinforcement learning, Grace Hopper Celebration of Women in Computing, pp.13-18, 1997.

S. M. Savaresi, D. L. Boley, S. Bittanti, and G. Gazzaniga, Cluster selection in divisive clustering algorithms, SIAM Internation Conference on Data Mining, pp.299-314, 2002.
DOI : 10.1137/1.9781611972726.18