A. , R. Gabbrielli, M. And-mauro, and J. , An Empirical Evaluation of Portfolios Approaches for Solving CSPs, In CPAIOR. Lecture Notes in Computer Science, vol.7874, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00909297

A. , R. Gabbrielli, M. And-mauro, and J. , Features for Building CSP Portfolio Solvers, 2013.

A. , R. Gabbrielli, M. And-mauro, and J. , An Enhanced Features Extractor for a Portfolio of Constraint Solvers, SAC, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01089183

A. , R. Gabbrielli, M. And-mauro, and J. , Portfolio Approaches for Constraint Optimization Problems, LION, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01088429

A. , S. And-celisse, and A. , A survey of cross-validation procedures for model selection, Statistics Surveys, vol.4, pp.40-79, 2010.

C. , R. Dovier, A. And-mauro, and J. , Compiling and executing declarative modeling languages to gecode, ICLP. Lecture Notes in Computer Science, pp.744-748, 2008.

D. Cat, B. Bogaerts, B. Devriendt, J. And-denecker, and M. , Model Expansion in the Presence of Function Symbols Using Constraint Programming, 2013 IEEE 25th International Conference on Tools with Artificial Intelligence, pp.1068-1075, 2013.
DOI : 10.1109/ICTAI.2013.159

G. , C. Guerri, A. Hnich, B. And-milano, and M. , Making Choices Using Structure at the Instance Level within a Case Based Reasoning Framework, In CPAIOR. Lecture Notes in Computer Science, vol.3011, pp.380-386, 2004.

G. , M. Kaminski, R. Kaufmann, B. Schaub, T. Schneider et al., A Portfolio Solver for Answer Set Programming: Preliminary Report, In LPNMR. Lecture Notes in Computer Science, vol.6645, pp.352-357, 2011.

G. , C. P. And, and B. Selman, Algorithm portfolios, Artif. Intell, vol.126, pp.1-2, 2001.

H. , H. Kaminski, R. Schaub, T. And, and M. T. Schneider, aspeed: ASP-based Solver Scheduling, ICLP (Technical Communications, pp.176-187, 2012.

H. , F. Xu, L. Hoos, H. H. , A. Leyton-brown et al., Algorithm Runtime Prediction: The State of the Art, 2012.

K. , S. Malitsky, Y. Sabharwal, A. Samulowitz, H. And-sellmann et al., Algorithm Selection and Scheduling ISAC -Instance-Specific Algorithm Configuration, ECAI. Frontiers in Artificial Intelligence and Applications, 2010.

M. , Y. Sabharwal, A. Samulowitz, H. And-sellmann, and M. , Algorithm Portfolios Based on Cost-Sensitive Hierarchical Clustering, IJCAI. IJCAI/AAAI, 2013.

M. , Y. And, and M. Sellmann, Instance-Specific Algorithm Configuration as a Method for Non-Model-Based Portfolio Generation, In CPAIOR. Lecture Notes in Computer Science, vol.7298, 2012.

M. , M. Pulina, L. And-ricca, and F. , The Multi-Engine ASP Solver me-asp, In JELIA. Lecture Notes in Computer Science, vol.7519, pp.484-487, 2012.

N. , M. Maric, F. And-janicic, and P. , Instance-Based Selection of Policies for SAT Solvers, SAT. Lecture Notes in Computer Science, pp.326-340, 2009.

O. , E. Hebrard, E. Holland, A. Nugent, C. And et al., Using casebased reasoning in an algorithm portfolio for constraint solving, 2009.

P. , L. And, and A. Tacchella, A Multi-engine Solver for Quantified Boolean Formulas, In CP. Lecture Notes in Computer Science, vol.4741, pp.574-589, 2007.

P. , L. And, and A. Tacchella, A self-adaptive multi-engine solver for quantified boolean formulas, Constraints, vol.14, issue.1, pp.80-116, 2009.

S. , H. Reddy, C. Sabharwal, A. And-sellmann, and M. , Snappy: A simple algorithm portfolio, SAT. Lecture Notes in Computer Science, pp.422-428, 2013.

S. , D. H. Samulowitz, H. Herbrich, R. Graepel, T. Pulina et al., Collaborative expert portfolio management, AAAI, 2010.

W. , D. Leake, D. And-bramley, and R. , Case-Based Recommender Components for Scientific Problem-Solving Environments, Procs. of the 16th International Association for Mathematics and Computers in Simulation World Congress, 2000.

X. , L. Hutter, F. Hoos, H. H. , A. Leyton-brown et al., SATzilla-07: The Design and Analysis of an Algorithm Portfolio for SAT, In CP. Lecture Notes in Computer Science, vol.4741, 2007.

X. , L. Hutter, F. Shen, J. Hoos, H. et al., SATzilla2012: Improved algorithm selection based on cost-sensitive classification models. Solver description, SAT Challenge, 2012.