B. Hurley, D. Mehta, and B. O'sullivan, Elastic solver: Balancing solution time and energy consumption

B. Hurley, Exploiting machine learning for combinatorial problem solving and optimisation, 2016.

C. P. Gomes, B. Selman, N. Crato, and H. A. Kautz, Heavy-tailed phenomena in satisfiability and constraint satisfaction problems, J. Autom. Reasoning, vol.24, issue.1, pp.67-100, 2000.

M. Luby, A. Sinclair, and D. Zuckerman, Optimal speedup of las vegas algorithms, Information Processing Letters, vol.47, issue.4, pp.173-180, 1993.

T. Hogg and C. P. Williams, Expected gains from parallelizing constraint solving for hard problems, Proceedings of AAAI 94, pp.331-336, 1994.

R. M. Aiex, M. G. Resende, and C. C. Ribeiro, Probability distribution of solution time in GRASP: an experimental investigation, J. Heuristics, vol.8, issue.3, pp.343-373, 2002.

C. Truchet, A. Arbelaez, F. Richoux, and P. Codognet, Estimating parallel runtimes for randomized algorithms in constraint solving, J. Heuristics, vol.22, issue.4, pp.613-648, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01248168

A. Arbelaez, C. Truchet, and P. Codognet, Using sequential runtime distributions for the parallel speedup prediction of SAT local search, TPLP, vol.13, pp.625-639, 2013.

F. Hutter, L. Xu, H. H. Hoos, and K. Leyton-brown, Algorithm runtime prediction: Methods & evaluation, Artif. Intell, vol.206, pp.79-111, 2014.

K. Eggensperger, M. Lindauer, and F. Hutter, Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, IJCAI 2018, pp.1442-1448, 2018.

D. Frost, I. Rish, and L. Vila, Summarizing CSP hardness with continuous probability distributions, Proceedings of AAAI'97/IAAI'97, pp.327-333, 1997.