2. Borrett, J., Tsang, E., Walsh, N.: Adaptive constraint satisfaction: The quickest first principle. In: ECAI. pp. 160–164 (1996)
3. Dechter, R.: Constraint Processing. Elsevier Science (2003) 4. Dietterich, T.G.: Ensemble methods in machine learning. In: First International Workshop on Multiple Classifier Systems. pp. 1–15 (2000)
5. Epstein, S., Freuder, E., Wallace, R., Morozov, A., Samuels, B.: The adaptive constraint engine. In: CP. pp. 525–542 (2002)
6. Freund, Y., Schapire, R.E.: A decision-theoretic generalization of on-line learning and an application to boosting. In: EuroCOLT. pp. 23–37 (1995)
7. Gent, I., Jefferson, C., Kotthoff, L., Miguel, I., Moore, N., Nightingale, P., Petrie, K.: Learning when to use lazy learning in constraint solving. In: ECAI (2010)
8. Gent, I., Jefferson, C., Miguel, I.: Minion: A fast scalable constraint solver. In:
ECAI. pp. 98–102 (2006)
9. Gent, I., Miguel, I., Moore, N.: Lazy explanations for constraint propagator. In:
PADL (2010)
10. Gent, I., Miguel, I., Nightingale, P.: Generalised arc consistency for the alldifferent constraint: An empirical survey. Artif. Intell. 172(18), 1973–2000 (2008)
11. Guerri, A., Milano, M.: Learning techniques for automatic algorithm portfolio selection. In: ECAI. pp. 475–479 (2004)
12. Hall, M., Frank, E., Holmes, G., Pfahringer, B., Reutemann, P., Witten, I.: The WEKA data mining software: An update. SIGKDD Explorations 11(1) (2009)
13. van Hoeve, W.J.: The alldifferent Constraint: A Survey (2001) 14. Hutter, F., Hamadi, Y., Hoos, H., Leyton-Brown, K.: Performance prediction and automated tuning of randomized and parametric algorithms. In: CP. pp. 213–228 (2006)
15. KhudaBukhsh, A., Xu, L., Hoos, H., Leyton-Brown, K.: SATenstein: Automatically building local search SAT solvers from components. In: IJCAI. pp. 517–524 (2009)
16. Kotthof f, L.: Constraint solvers: An empirical evaluation of design decisions.

CIRCA preprint (2009), http://www-circa.mcs.st-and.ac.uk/Preprints/solverdesign.pdf 17. Lagoudakis, M., Littman, M.: Reinforcement learning for algorithm selection. In:
AAAI/IAAI. p. 1081 (2000)
18. Lecoutre, C.: XCSP benchmarks. http://tinyurl.com/y6hpphs (June 2010)
19. Leyton-Brown, K., Nudelman, E., Andrew, G., McFadden, J., Shoham, Y.: A portfolio approach to algorithm selection. In: IJCAI. pp. 1542–1543 (2003)
20. McKay, B.: Practical graph isomorphism. In: Numerical mathematics and computing, Proc. 10th Manitoba Conf., Winnipeg/Manitoba 1980, Congr. Numerantium 30. pp. 45–87 (1981), see also http://cs.anu.edu.au/people/bdm/nauty 21. Minton, S.: Automatically configuring constraint satisfaction programs: A case study. Constraints 1(1/2), 7–43 (1996)
22. O'Mahony, E., Hebrard, E., Holland, A., Nugent, C., O'Sullivan, B.: Using casebased reasoning in an algorithm portfolio for constraint solving. In: 19th Irish Conference on AI (2008)
23. Puget, J.F.: Constraint programming next challenge: Simplicity of use. In: CP. pp.

5–8 (2004)
24. R Development Core Team: R: A Language and Environment for Statistical Computing. R Foundation for Statistical Computing (2009)
25. R´egin, J.C.: A filtering algorithm for constraints of difference in CSPs. In: AAAI.

pp. 362–367 (1994)
26. Rice, J.: The algorithm selection problem. Advances in Computers 15, 65–118
(1976)