Pietro S. Oliveto

According to our database1, Pietro S. Oliveto authored at least 76 papers between 2006 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2020
Guest Editorial Special Issue on Theoretical Foundations of Evolutionary Computation.
IEEE Trans. Evol. Comput., 2020

Theory of evolutionary computation - Special Issue Editorial.
Theor. Comput. Sci., 2020

When hypermutations and ageing enable artificial immune systems to outperform evolutionary algorithms.
Theor. Comput. Sci., 2020

Simple Hyper-Heuristics Control the Neighbourhood Size of Randomised Local Search Optimally for LeadingOnes<sup>*</sup>.
Evol. Comput., 2020

Fast Immune System Inspired Hypermutation Operators for Combinatorial Optimisation.
CoRR, 2020

On the Benefits of Populations for the Exploitation Speed of Standard Steady-State Genetic Algorithms.
Algorithmica, 2020

Fast Perturbative Algorithm Configurators.
Proceedings of the Parallel Problem Solving from Nature - PPSN XVI, 2020

A tight lower bound on the expected runtime of standard steady state genetic algorithms.
Proceedings of the GECCO '20: Genetic and Evolutionary Computation Conference, 2020

Runtime analysis of population-based evolutionary algorithms: introductory tutorial at GECCO 2020.
Proceedings of the GECCO '20: Genetic and Evolutionary Computation Conference, 2020

Analysis of the performance of algorithm configurators for search heuristics with global mutation operators.
Proceedings of the GECCO '20: Genetic and Evolutionary Computation Conference, 2020

Do sophisticated evolutionary algorithms perform better than simple ones?
Proceedings of the GECCO '20: Genetic and Evolutionary Computation Conference, 2020

How the Duration of the Learning Period Affects the Performance of Random Gradient Selection Hyper-Heuristics.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019
On the benefits and risks of using fitness sharing for multimodal optimisation.
Theor. Comput. Sci., 2019

On the Time and Space Complexity of Genetic Programming for Evolving Boolean Conjunctions.
J. Artif. Intell. Res., 2019

On the Analysis of Trajectory-Based Search Algorithms: When is it Beneficial to Reject Improvements?
Algorithmica, 2019

Artificial immune systems can find arbitrarily good approximations for the NP-hard number partitioning problem.
Artif. Intell., 2019

How Theoretical Analyses Can Impact Practical Applications of Evolutionary Computation.
Proceedings of the 11th International Joint Conference on Computational Intelligence, 2019

Runtime analysis of evolutionary algorithms: basic introduction: introductory tutorial at GECCO 2019.
Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2019

On the impact of the cutoff time on the performance of algorithm configurators.
Proceedings of the Genetic and Evolutionary Computation Conference, 2019

Evolving boolean functions with conjunctions and disjunctions via genetic programming.
Proceedings of the Genetic and Evolutionary Computation Conference, 2019

On inversely proportional hypermutations with mutation potential.
Proceedings of the Genetic and Evolutionary Computation Conference, 2019

On the Time Complexity of Algorithm Selection Hyper-Heuristics for Multimodal Optimisation.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018
Theoretical Analysis of Stochastic Search Algorithms.
Proceedings of the Handbook of Heuristics., 2018

Escaping Local Optima Using Crossover With Emergent Diversity.
IEEE Trans. Evol. Comput., 2018

Standard Steady State Genetic Algorithms Can Hillclimb Faster Than Mutation-Only Evolutionary Algorithms.
IEEE Trans. Evol. Comput., 2018

Computational Complexity Analysis of Genetic Programming.
CoRR, 2018

Hyper-heuristics Can Achieve Optimal Performance for Pseudo-Boolean Optimisation.
CoRR, 2018

How to Escape Local Optima in Black Box Optimisation: When Non-elitism Outperforms Elitism.
Algorithmica, 2018



Fast Artificial Immune Systems.
Proceedings of the Parallel Problem Solving from Nature - PPSN XV, 2018

Artificial Immune Systems Can Find Arbitrarily Good Approximations for the NP-Hard Partition Problem.
Proceedings of the Parallel Problem Solving from Nature - PPSN XV, 2018

On the runtime analysis of selection hyper-heuristics with adaptive learning periods.
Proceedings of the Genetic and Evolutionary Computation Conference, 2018

Standard steady state genetic algorithms can hillclimb faster than evolutionary algorithms using standard bit mutation.
Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2018

2017
Theoretical Analysis of Stochastic Search Algorithms.
CoRR, 2017

On Easiest Functions for Mutation Operators in Bio-Inspired Optimisation.
Algorithmica, 2017

When is it beneficial to reject improvements?
Proceedings of the Genetic and Evolutionary Computation Conference, 2017

On the runtime analysis of generalised selection hyper-heuristics for pseudo-boolean optimisation.
Proceedings of the Genetic and Evolutionary Computation Conference, 2017

Runtime analysis of population-based evolutionary algorithms: introductory tutorial at GECCO 2017.
Proceedings of the Genetic and Evolutionary Computation Conference, 2017

On the runtime analysis of the opt-IA artificial immune system.
Proceedings of the Genetic and Evolutionary Computation Conference, 2017

2016
Escaping Local Optima using Crossover with Emergent or Reinforced Diversity.
CoRR, 2016


Emergence of Diversity and Its Benefits for Crossover in Genetic Algorithms.
Proceedings of the Parallel Problem Solving from Nature - PPSN XIV, 2016

When Non-Elitism Outperforms Elitism for Crossing Fitness Valleys.
Proceedings of the 2016 on Genetic and Evolutionary Computation Conference, Denver, CO, USA, July 20, 2016

Runtime Analysis of Population-based Evolutionary Algorithms.
Proceedings of the Genetic and Evolutionary Computation Conference, 2016

Escaping Local Optima with Diversity Mechanisms and Crossover.
Proceedings of the 2016 on Genetic and Evolutionary Computation Conference, Denver, CO, USA, July 20, 2016

On the Analysis of Simple Genetic Programming for Evolving Boolean Functions.
Proceedings of the Genetic Programming - 19th European Conference, 2016

2015
Analysis of diversity mechanisms for optimisation in dynamic environments with low frequencies of change.
Theor. Comput. Sci., 2015

Improved time complexity analysis of the Simple Genetic Algorithm.
Theor. Comput. Sci., 2015

Editorial for the Special Issue on Theory of Evolutionary Algorithms 2014.
Evol. Comput., 2015

On Easiest Functions for Somatic Contiguous Hypermutations And Standard Bit Mutations.
Proceedings of the Genetic and Evolutionary Computation Conference, 2015

2014
On the runtime analysis of the Simple Genetic Algorithm.
Theor. Comput. Sci., 2014

On the Runtime Analysis of Fitness Sharing Mechanisms.
Proceedings of the Parallel Problem Solving from Nature - PPSN XIII, 2014

On the runtime analysis of stochastic ageing mechanisms.
Proceedings of the Genetic and Evolutionary Computation Conference, 2014

2013
Improved runtime analysis of the simple genetic algorithm.
Proceedings of the Genetic and Evolutionary Computation Conference, 2013

Runtime analysis of evolutionary algorithms: basic introduction.
Proceedings of the Genetic and Evolutionary Computation Conference, 2013

Approximating vertex cover using edge-based representations.
Proceedings of the Foundations of Genetic Algorithms XII, 2013

2012
Erratum: Simplified Drift Analysis for Proving Lower Bounds in Evolutionary Computation.
CoRR, 2012

On the analysis of the simple genetic algorithm.
Proceedings of the Genetic and Evolutionary Computation Conference, 2012

2011
Simplified Drift Analysis for Proving Lower Bounds in Evolutionary Computation.
Algorithmica, 2011

Evolutionary Algorithms for the Identification of Structural Systems in Earthquake Engineering.
Proceedings of the ECTA and FCTA 2011, 2011

On the Analysis of the Immune-Inspired B-Cell Algorithm for the Vertex Cover Problem.
Proceedings of the Artificial Immune Systems - 10th International Conference, 2011

On the effectiveness of crossover for migration in parallel evolutionary algorithms.
Proceedings of the 13th Annual Genetic and Evolutionary Computation Conference, 2011

2010
Fixed Parameter Evolutionary Algorithms and Maximum Leaf Spanning Trees: A Matter of Mutation.
Proceedings of the Parallel Problem Solving from Nature, 2010

Ant colony optimization and the minimum cut problem.
Proceedings of the Genetic and Evolutionary Computation Conference, 2010

Co-evolution of Optimal Agents for the Alternating Offers Bargaining Game.
Proceedings of the Applications of Evolutionary Computation, 2010

2009
Analysis of the (1+1) -EA for Finding Approximate Solutions to Vertex Cover Problems.
IEEE Trans. Evol. Comput., 2009

Analysis of Diversity-Preserving Mechanisms for Global Exploration.
Evol. Comput., 2009

Theoretical analysis of fitness-proportional selection: landscapes and efficiency.
Proceedings of the Genetic and Evolutionary Computation Conference, 2009

Theoretical analysis of rank-based mutation - combining exploration and exploitation.
Proceedings of the IEEE Congress on Evolutionary Computation, 2009

2008
Theoretical analysis of diversity mechanisms for global exploration.
Proceedings of the Genetic and Evolutionary Computation Conference, 2008

Analysis of population-based evolutionary algorithms for the vertex cover problem.
Proceedings of the IEEE Congress on Evolutionary Computation, 2008

2007
Time complexity of evolutionary algorithms for combinatorial optimization: A decade of results.
Int. J. Autom. Comput., 2007

On the Convergence of Immune Algorithms.
Proceedings of the IEEE Symposium on Foundations of Computational Intelligence, 2007

Evolutionary algorithms and the Vertex Cover problem.
Proceedings of the IEEE Congress on Evolutionary Computation, 2007

2006
Analysis of an evolutionary algorithm with HyperMacromutation and stop at first constructive mutation heuristic for solving trap functions.
Proceedings of the 2006 ACM Symposium on Applied Computing (SAC), 2006


  Loading...