A. Arbelaez, Y. Hamadi, and M. Sebag, Online heuristic selection in constraint programming, Symposiumon Combinatorial Search (SoCS), 2009.
URL : https://hal.archives-ouvertes.fr/inria-00392752

F. Boussemart, F. Hemery, C. Lecoutre, and L. Sais, Boosting systematic search by weighting constraints, ECAI'04, 2004.

N. Cristianini and J. Shawe-taylor, An Introduction to Support Vector Machines and other kernel-based learning methods, 2000.
DOI : 10.1017/CBO9780511801389

R. M. Haralick and G. L. Elliott, Increasing tree search efficientcy for constraint satisfaction problems, In Artificial Intelligence, 1980.
DOI : 10.1016/0004-3702(80)90051-x

F. Hutter and Y. Hamadi, Parameter adjustment based on performance prediction: Towards an instance-aware problem solver. Number MSR-TR-2005-125, 2005.

E. O-'mahony, E. Hebrard, A. Holland, C. Nugent, and B. O. Sullivan, Using casebased reasoning in an algorithm portfolio for constraint solving, AICS'08, 2008.

P. Refalo, Impact-Based Search Strategies for Constraint Programming, CP'04, 2004.
DOI : 10.1007/978-3-540-30201-8_41
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.461.1328

H. Samulowitz and R. Memisevic, Learning to solve qbf, AAAI'07, 2007.

K. Smith-miles, Cross-disciplinary perspectives on meta-learning for algorithm selection, ACM Computing Surveys, vol.41, issue.1, 2008.
DOI : 10.1145/1456650.1456656

L. Xu, F. Hutter, H. H. Hoos, and K. Leyton-brown, SATzilla-07: The Design and Analysis of an Algorithm Portfolio for SAT, CP'07, 2007.
DOI : 10.1007/978-3-540-74970-7_50