35 citations · 48 across the 9 of their papers we have counts for
15 papers
On Steady-State Evolutionary Algorithms and Selective Pressure: Why Inverse Rank-Based Allocation of Reproductive Trials is Best
Dogan Corus, Andrei Lissovoi, Pietro S. Oliveto +1
We analyse the impact of the selective pressure for the global optimisation capabilities of steady-state EAs. For the standard bimodal benchmark function \twomax we rigorously prov…
Fast Immune System Inspired Hypermutation Operators for Combinatorial Optimisation
D. Corus, P. S. Oliveto, D. Yazdani
Various studies have shown that immune system inspired hypermutation operators can allow artificial immune systems (AIS) to be very efficient at escaping local optima of multimodal…
Fast Perturbative Algorithm Configurators
George T. Hall, Pietro Simone Oliveto, Dirk Sudholt
Recent work has shown that the ParamRLS and ParamILS algorithm configurators can tune some simple randomised search heuristics for standard benchmark functions in linear expected t…
Analysis of the Performance of Algorithm Configurators for Search Heuristics with Global Mutation Operators
George T. Hall, Pietro Simone Oliveto, Dirk Sudholt
Recently it has been proved that a simple algorithm configurator called ParamRLS can efficiently identify the optimal neighbourhood size to be used by stochastic local search to op…
On the Impact of the Cutoff Time on the Performance of Algorithm Configurators
George T. Hall, Pietro S. Oliveto, Dirk Sudholt
Algorithm configurators are automated methods to optimise the parameters of an algorithm for a class of problems. We evaluate the performance of a simple random local search config…
Evolving Boolean Functions with Conjunctions and Disjunctions via Genetic Programming
Benjamin Doerr, Andrei Lissovoi, Pietro S. Oliveto
Recently it has been proved that simple GP systems can efficiently evolve the conjunction of variables if they are equipped with the minimal required components. In this paper,…