B. , S. Mcinnes, L. C. Norris, B. And-raghavan, and P. , The role of multi-method linear solvers in pde-based simulations, pp.828-839, 2003.

B. , M. Dutot, P. Goldman, A. Ngoko, Y. And-trystram et al., Combining multiple heuristics on discrete resources, 11th Workshop on Advances in Parallel and Distributed Computational Models APDCMIPDPS), 2009.
URL : https://hal.archives-ouvertes.fr/hal-00688739

B. , M. Dutot, P. Goldman, A. Ngoko, Y. And-trystram et al., Approximating the discrete resource sharing scheduling problem, Int. J. Found. Comput. Sci, vol.22, issue.3, pp.639-656, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00796858

B. , E. K. Curtois, T. Hyde, M. R. Kendall, G. Ochoa et al., Iterated local search vs. hyper-heuristics: Towards general-purpose search algorithms, IEEE Congress on Evolutionary Computation, pp.1-8, 2010.

C. , T. Leiserson, C. Rivest, R. And, and C. Stein, Introduction to algorithms. MIT electrical engineering and computer science series, 2001.

D. , P. Rzadca, K. Saule, E. And-trystram, and D. , Multi-objective scheduling, pp.978-1420072730, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00800427

E. , M. And, and M. Kamel, A taxonomy of cooperative search algorithms, Hybrid Metaheuristics, pp.32-41, 2005.

G. , M. And, and J. Schmidhuber, Algorithm selection as a bandit problem with unbounded losses, 2008.

G. , C. Hnich, B. Bridge, D. G. And-freuder, and E. C. , Using cbr to select solution strategies in constraint programming, ICCBR, pp.222-236, 2005.

G. , C. And, and B. Selman, Algorithm portfolios, Artificial Intelligence, vol.126, issue.1, pp.43-62, 2001.

G. , C. P. Fernndez, C. Selman, B. And-bessire, and C. , Statistical regimes across constrainedness regions, Constraints, pp.32-46, 2004.

H. , Z. Krajecki, M. Singer, D. Metz, U. Reims et al., Domain decomposition for parallel resolution of constraint satisfaction problems with openmp, Proceedings of the Second European Workshop on OpenMP, 2000.

H. , E. N. Catlin, A. C. Rice, J. R. Verykios, V. S. Ramakrishnan et al., PYTHIA-II: a knowledge/database system for managing performance data and recommending scientific software, ACM Trans. Math. Softw, vol.26, issue.2, pp.227-253, 2000.

H. , B. Lukose, R. And-hogg, and T. , An economics approach to hard computational problems, Science, vol.275, issue.5296, pp.51-54, 1997.

M. Frigo and S. G. , FFTW: an adaptive software architecture for the FFT, Proceedings of the 1998 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP '98 (Cat. No.98CH36181), 1998.
DOI : 10.1109/ICASSP.1998.681704

N. , Y. And-trystram, and D. , Combining numerical iterative solvers, PARCO, pp.43-50, 2009.

N. , Y. And-trystram, and D. , Combining SAT solvers on dicrete resources, HPCS, International Conference on high performance computing and simulation, pp.153-160, 2009.

P. , S. And, and S. L. Epstein, Random subsets support learning a mixture of heuristics, FLAIRS Conference, pp.616-621, 2007.

P. , M. And-rinner, and B. , Design and implementation of a parallel constraint satisfaction algorithm

S. , T. Fine, S. And-mansour, and Y. , Combining multiple heuristics, STACS 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, pp.242-253, 2006.

S. , L. And-chatalic, and P. , SATEx: a web-based framework for SAT experimentation, Electronic Notes in Discrete Mathematics, vol.9, pp.129-149, 2001.

S. , M. Golovin, D. And, S. , and S. , Combining multiple heuristics online, proceedings of the national conference on artificial intelligence, p.1197, 1999.

X. , L. Hutter, F. Hoos, H. H. , A. Leyton-brown et al., Satzilla: Portfolio-based algorithm selection for sat, J. Artif. Intell. Res. (JAIR), vol.32, pp.565-606, 2008.