Andrei Lissovoi

30 papers A* 4A 9Journal 14Unranked 1
YearRankTypeTitle / Venue / Authors
2025 A* conf
(1+1) Genetic Programming with Functionally Complete Instruction Sets Can Evolve Boolean Conjunctions and Disjunctions with Arbitrarily Small Error.
AAAI
Benjamin Doerr, Andrei Lissovoi, Pietro S. Oliveto
2023 J jnl
(1+1) Genetic Programming With Functionally Complete Instruction Sets Can Evolve Boolean Conjunctions and Disjunctions with Arbitrarily Small Error.
CoRR
Benjamin Doerr, Andrei Lissovoi, Pietro S. Oliveto
2023 J jnl
(1+1) genetic programming with functionally complete instruction sets can evolve Boolean conjunctions and disjunctions with arbitrarily small error.
Artif. Intell.
Benjamin Doerr, Andrei Lissovoi, Pietro S. Oliveto
2023 J jnl
When move acceptance selection hyper-heuristics outperform Metropolis and elitist evolutionary algorithms and when not.
Artif. Intell.
Andrei Lissovoi, Pietro S. Oliveto, John Alasdair Warwicker
2021 J jnl
On Steady-State Evolutionary Algorithms and Selective Pressure: Why Inverse Rank-Based Allocation of Reproductive Trials Is Best.
ACM Trans. Evol. Learn. Optim.
Dogan Corus, Andrei Lissovoi, Pietro S. Oliveto, Carsten Witt
2021 J jnl
On Steady-State Evolutionary Algorithms and Selective Pressure: Why Inverse Rank-Based Allocation of Reproductive Trials is Best.
CoRR
Dogan Corus, Andrei Lissovoi, Pietro S. Oliveto, Carsten Witt
2020 — ch.
Computational Complexity Analysis of Genetic Programming.
Theory of Evolutionary Computation
Andrei Lissovoi, Pietro S. Oliveto
2020 A* conf
How the Duration of the Learning Period Affects the Performance of Random Gradient Selection Hyper-Heuristics.
AAAI
Andrei Lissovoi, Pietro S. Oliveto, John Alasdair Warwicker
2020 J jnl
Simple Hyper-Heuristics Control the Neighbourhood Size of Randomised Local Search Optimally for LeadingOnes
Evol. Comput.
Andrei Lissovoi, Pietro S. Oliveto, John Alasdair Warwicker
2019 J jnl
Evolving Boolean Functions with Conjunctions and Disjunctions via Genetic Programming.
CoRR
Benjamin Doerr, Andrei Lissovoi, Pietro S. Oliveto
2019 A conf
Evolving boolean functions with conjunctions and disjunctions via genetic programming.
GECCO
Benjamin Doerr, Andrei Lissovoi, Pietro S. Oliveto
2019 A* conf
On the Time Complexity of Algorithm Selection Hyper-Heuristics for Multimodal Optimisation.
AAAI
Andrei Lissovoi, Pietro S. Oliveto, John Alasdair Warwicker
2019 J jnl
On the Time and Space Complexity of Genetic Programming for Evolving Boolean Conjunctions.
J. Artif. Intell. Res.
Andrei Lissovoi, Pietro S. Oliveto
2018 J jnl
Computational Complexity Analysis of Genetic Programming.
CoRR
Andrei Lissovoi, Pietro S. Oliveto
2018 J jnl
Hyper-heuristics Can Achieve Optimal Performance for Pseudo-Boolean Optimisation.
CoRR
Andrei Lissovoi, Pietro S. Oliveto, John Alasdair Warwicker
2018 A* conf
On the Time and Space Complexity of Genetic Programming for Evolving Boolean Conjunctions.
AAAI
Andrei Lissovoi, Pietro S. Oliveto
2018 A conf
On the runtime analysis of selection hyper-heuristics with adaptive learning periods.
GECCO
Benjamin Doerr, Andrei Lissovoi, Pietro S. Oliveto, John Alasdair Warwicker
2018 J jnl
The Impact of a Sparse Migration Topology on the Runtime of Island Models in Dynamic Optimization.
Algorithmica
Andrei Lissovoi, Carsten Witt
2018 — conf
Tutorials at PPSN 2018.
PPSN (2)
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
2017 J jnl
A Runtime Analysis of Parallel Evolutionary Algorithms in Dynamic Optimization.
Algorithmica
Andrei Lissovoi, Carsten Witt
2017 A conf
On the runtime analysis of generalised selection hyper-heuristics for pseudo-boolean optimisation.
GECCO
Andrei Lissovoi, Pietro S. Oliveto, John Alasdair Warwicker
2017 A conf
Theoretical results on bet-and-run as an initialisation strategy.
GECCO
Andrei Lissovoi, Dirk Sudholt, Markus Wagner, Christine Zarges
2016 — —
Analysis of Ant Colony Optimization and Population-Based Evolutionary Algorithms on Dynamic Problems.
Andrei Lissovoi
2016 J jnl
MMAS Versus Population-Based EA on a Family of Dynamic Fitness Functions.
Algorithmica
Andrei Lissovoi, Carsten Witt
2016 A conf
The Impact of Migration Topology on the Runtime of Island Models in Dynamic Optimization.
GECCO
Andrei Lissovoi, Carsten Witt
2015 A conf
(1+1) EA on Generalized Dynamic OneMax.
FOGA
Timo Kötzing, Andrei Lissovoi, Carsten Witt
2015 A conf
On the Utility of Island Models in Dynamic Optimization.
GECCO
Andrei Lissovoi, Carsten Witt
2015 J jnl
Runtime analysis of ant colony optimization on dynamic shortest path problems.
Theor. Comput. Sci.
Andrei Lissovoi, Carsten Witt
2014 A conf
MMAS vs. population-based EA on a family of dynamic fitness functions.
GECCO
Andrei Lissovoi, Carsten Witt
2013 A conf
Runtime analysis of ant colony optimization on dynamic shortest path problems.
GECCO
Andrei Lissovoi, Carsten Witt