We introduce a master–worker framework for parallel global optimization of computationally expensive functions using response surface models. In particular, we parallelize two r...
In this paper we propose to use a distance metric based on user-preferences to efficiently find solutions for manyobjective problems. We use a particle swarm optimization (PSO) a...
Compiler writers have crafted many heuristics over the years to approximately solve NP-hard problems efficiently. Finding a heuristic that performs well on a broad range of applic...
Mark Stephenson, Saman P. Amarasinghe, Martin C. M...
Abstract— Memetic algorithms arise as very effective algorithms to obtain reliable and high accurate solutions for complex continuous optimization problems. Nowadays, high dimens...
This paper investigates how the Univariate Marginal Distribution Algorithm (UMDA) behaves in non-stationary environments when engaging in sampling and selection strategies designe...