Andrei Lissovoi

According to our database, Andrei Lissovoi authored at least 24 papers between 2014 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

(1+1) genetic programming with functionally complete instruction sets can evolve Boolean conjunctions and disjunctions with arbitrarily small error.

Benjamin Doerr, Andrei Lissovoi, Pietro S. Oliveto

Artif. Intell., June, 2023

When move acceptance selection hyper-heuristics outperform Metropolis and elitist evolutionary algorithms and when not.

Andrei Lissovoi, Pietro S. Oliveto, John Alasdair Warwicker

Artif. Intell., 2023

2021

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, Carsten Witt

ACM Trans. Evol. Learn. Optim., 2021

2020

Computational Complexity Analysis of Genetic Programming.

Andrei Lissovoi, Pietro S. Oliveto

Proceedings of the Theory of Evolutionary Computation, 2020

Simple Hyper-Heuristics Control the Neighbourhood Size of Randomised Local Search Optimally for LeadingOnes^*.

Andrei Lissovoi, Pietro S. Oliveto, John Alasdair Warwicker

Evol. Comput., 2020

How the Duration of the Learning Period Affects the Performance of Random Gradient Selection Hyper-Heuristics.

Andrei Lissovoi, Pietro S. Oliveto, John Alasdair Warwicker

Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019

On the Time and Space Complexity of Genetic Programming for Evolving Boolean Conjunctions.

Andrei Lissovoi, Pietro S. Oliveto

J. Artif. Intell. Res., 2019

Evolving boolean functions with conjunctions and disjunctions via genetic programming.

Benjamin Doerr, Andrei Lissovoi, Pietro S. Oliveto

Proceedings of the Genetic and Evolutionary Computation Conference, 2019

On the Time Complexity of Algorithm Selection Hyper-Heuristics for Multimodal Optimisation.

Andrei Lissovoi, Pietro S. Oliveto, John Alasdair Warwicker

Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018

Computational Complexity Analysis of Genetic Programming.

Andrei Lissovoi, Pietro S. Oliveto

CoRR, 2018

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

Andrei Lissovoi, Pietro S. Oliveto, John Alasdair Warwicker

CoRR, 2018

The Impact of a Sparse Migration Topology on the Runtime of Island Models in Dynamic Optimization.

Andrei Lissovoi, Carsten Witt

Algorithmica, 2018

Tutorials at PPSN 2018.

Gisele Lobo Pappa, Michael T. M. Emmerich, Ana L. C. Bazzan, Will N. Browne, Kalyanmoy Deb, Carola Doerr, Marko Durasevic, Michael G. Epitropakis, Saemundur O. Haraldsson, Domagoj Jakobovic, Pascal Kerschke, Krzysztof Krawiec, Per Kristian Lehre, Xiaodong Li, Andrei Lissovoi, Pekka Malo, Luis Martí, Yi Mei, Juan Julián Merelo Guervós, Julian F. Miller, Alberto Moraglio, Antonio J. Nebro, Su Nguyen, Gabriela Ochoa, Pietro S. Oliveto, Stjepan Picek, Nelishia Pillay, Mike Preuss, Marc Schoenauer, Roman Senkerik, Ankur Sinha, Ofer M. Shir, Dirk Sudholt, L. Darrell Whitley, Mark Wineberg, John R. Woodward, Mengjie Zhang

Proceedings of the Parallel Problem Solving from Nature - PPSN XV, 2018

On the runtime analysis of selection hyper-heuristics with adaptive learning periods.

Benjamin Doerr, Andrei Lissovoi, Pietro S. Oliveto, John Alasdair Warwicker

Proceedings of the Genetic and Evolutionary Computation Conference, 2018

2017

A Runtime Analysis of Parallel Evolutionary Algorithms in Dynamic Optimization.

Andrei Lissovoi, Carsten Witt

Algorithmica, 2017

Theoretical results on bet-and-run as an initialisation strategy.

Andrei Lissovoi, Dirk Sudholt, Markus Wagner, Christine Zarges

Proceedings of the Genetic and Evolutionary Computation Conference, 2017

On the runtime analysis of generalised selection hyper-heuristics for pseudo-boolean optimisation.

Andrei Lissovoi, Pietro S. Oliveto, John Alasdair Warwicker

Proceedings of the Genetic and Evolutionary Computation Conference, 2017

2016

Analysis of Ant Colony Optimization and Population-Based Evolutionary Algorithms on Dynamic Problems.

Andrei Lissovoi

PhD thesis, 2016

MMAS Versus Population-Based EA on a Family of Dynamic Fitness Functions.

Andrei Lissovoi, Carsten Witt

Algorithmica, 2016

The Impact of Migration Topology on the Runtime of Island Models in Dynamic Optimization.

Andrei Lissovoi, Carsten Witt

Proceedings of the 2016 on Genetic and Evolutionary Computation Conference, Denver, CO, USA, July 20, 2016

2015

Runtime analysis of ant colony optimization on dynamic shortest path problems.

Andrei Lissovoi, Carsten Witt

Theor. Comput. Sci., 2015

On the Utility of Island Models in Dynamic Optimization.

Andrei Lissovoi, Carsten Witt

Proceedings of the Genetic and Evolutionary Computation Conference, 2015

(1+1) EA on Generalized Dynamic OneMax.

Timo Kötzing, Andrei Lissovoi, Carsten Witt

Proceedings of the 2015 ACM Conference on Foundations of Genetic Algorithms XIII, Aberystwyth, United Kingdom, January 17, 2015

2014

MMAS vs. population-based EA on a family of dynamic fitness functions.

Andrei Lissovoi, Carsten Witt

Proceedings of the Genetic and Evolutionary Computation Conference, 2014