35 citations · 60 across the 18 of their papers we have counts for
5 papers · 1 filter
Computational Complexity Analysis of Genetic Programming
Andrei Lissovoi, Pietro S. Oliveto
Genetic programming (GP) is an evolutionary computation technique to solve problems in an automated, domain-independent way. Rather than identifying the optimum of a function as in…
Artificial Immune Systems Can Find Arbitrarily Good Approximations for the NP-Hard Number Partitioning Problem
Dogan Corus, Pietro S. Oliveto, Donya Yazdani
Typical artificial immune system (AIS) operators such as hypermutations with mutation potential and ageing allow to efficiently overcome local optima from which evolutionary algori…
Fast Artificial Immune Systems
Dogan Corus, Pietro S. Oliveto, Donya Yazdani
Various studies have shown that characteristic Artificial Immune System (AIS) operators such as hypermutations and ageing can be very efficient at escaping local optima of multimod…
When Hypermutations and Ageing Enable Artificial Immune Systems to Outperform Evolutionary Algorithms
Dogan Corus, Pietro S. Oliveto, Donya Yazdani
We present a time complexity analysis of the Opt-IA artificial immune system (AIS). We first highlight the power and limitations of its distinguishing operators (i.e., hypermutatio…
Simple Hyper-heuristics Control the Neighbourhood Size of Randomised Local Search Optimally for LeadingOnes
Andrei Lissovoi, Pietro S. Oliveto, John Alasdair Warwicker
Selection HHs are randomised search methodologies which choose and execute heuristics during the optimisation process from a set of low-level heuristics. A machine learning mechani…