In the past 35 years, parallel computing has drawn increasing interest from the academic
community, especially in solving complex optimization problems that require large amounts …

In this work we propose a new error-correction framework, called CoRe, which uses
counterexamples, or bug traces, generated in verification to automatically correct errors in …

Some optimization problems can be tackled only with metaheuristic methods, and to obtain
a satisfactory metaheuristic, it is necessary to develop and experiment with various methods …

This paper tackles the problem of modeling a shared-memory metaheuristic scheme. The
use of a model of the execution time allows us to decide at running time the number of …

Abstract The solution of Protein–Ligand Docking Problems can be approached through
metaheuristics, and satisfactory metaheuristics can be obtained with hyperheuristics …

This paper studies the auto-tuning of shared-memory hyperheuristics developed on top of a
unified shared-memory metaheuristic scheme. A theoretical model of the execution time of …

Virtual screening (VS) methods aid clinical research by predicting the interaction of ligands
with pharmacological targets. The computational requirements of VS, along with the size of …

This paper studies the development of message-passing parameterized schemes of
metaheuristics and the use of auto-tuning techniques to optimize their execution time …

Vector Autoregression Models are multi-equation models that linearly describe the
simultaneous interactions and behavior among a group of variables, using only their own …

This paper describes and assesses a parallel multimethod hyperheuristic for the solution of
complex global optimization problems. In a multimethod hyperheuristic, different …