Denis Antipov
Orcid: 0000-0001-7906-096XAffiliations:
- University of Adelaide, Australia
- ITMO University, St. Petersburg, Russia
According to our database1,
Denis Antipov
authored at least 35 papers
between 2015 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
Lazy Parameter Tuning and Control: Choosing All Parameters Randomly from a Power-Law Distribution.
Algorithmica, February, 2024
CoRR, 2024
Runtime Analysis of Evolutionary Diversity Optimization on the Multi-objective (LeadingOnes, TrailingZeros) Problem.
CoRR, 2024
Runtime Analysis of Evolutionary Diversity Optimization on a Tri-Objective Version of the (LeadingOnes, TrailingZeros) Problem.
Proceedings of the Parallel Problem Solving from Nature - PPSN XVIII, 2024
Local Optima in Diversity Optimization: Non-trivial Offspring Population is Essential.
Proceedings of the Parallel Problem Solving from Nature - PPSN XVIII, 2024
Proceedings of the Parallel Problem Solving from Nature - PPSN XVIII, 2024
Using 3-Objective Evolutionary Algorithms for the Dynamic Chance Constrained Knapsack Problem.
Proceedings of the Genetic and Evolutionary Computation Conference, 2024
Effective 2- and 3-Objective MOEA/D Approaches for the Chance Constrained Knapsack Problem.
Proceedings of the Genetic and Evolutionary Computation Conference, 2024
A Detailed Experimental Analysis of Evolutionary Diversity Optimization for OneMinMax.
Proceedings of the Genetic and Evolutionary Computation Conference, 2024
Proceedings of the Genetic and Evolutionary Computation Conference, 2024
2023
Larger Offspring Populations Help the (1 + (λ, λ)) Genetic Algorithm to Overcome the Noise.
CoRR, 2023
Larger Offspring Populations Help the (1 + (λ, λlambda)) Genetic Algorithm to Overcome the Noise.
Proceedings of the Genetic and Evolutionary Computation Conference, 2023
Proceedings of the 17th ACM/SIGEVO Conference on Foundations of Genetic Algorithms, 2023
2022
Algorithmica, 2022
Proceedings of the GECCO '22: Genetic and Evolutionary Computation Conference, Boston, Massachusetts, USA, July 9, 2022
Precise runtime analysis for plateau functions: (hot-off-the-press track at GECCO 2022).
Proceedings of the GECCO '22: Genetic and Evolutionary Computation Conference, Companion Volume, Boston, Massachusetts, USA, July 9, 2022
2021
The lower bounds on the runtime of the (1 + (λ, λ)) GA on the minimum spanning tree problem.
Proceedings of the GECCO '21: Genetic and Evolutionary Computation Conference, 2021
The effect of non-symmetric fitness: the analysis of crossover-based algorithms on RealJump functions.
Proceedings of the FOGA '21: Foundations of Genetic Algorithms XVI, 2021
2020
Methods for Tight Analysis of Population-based Evolutionary Algorithms. (Méthodes d'analyse précise des algorithmes évolutifs basés sur la population / Методы точного анализа популяционных эволюционных алгоритмов).
PhD thesis, 2020
Proceedings of the Parallel Problem Solving from Nature - PPSN XVI, 2020
Proceedings of the Parallel Problem Solving from Nature - PPSN XVI, 2020
Proceedings of the GECCO '20: Genetic and Evolutionary Computation Conference, 2020
2019
CoRR, 2019
Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2019
Proceedings of the Genetic and Evolutionary Computation Conference, 2019
Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms, 2019
2018
Proceedings of the Parallel Problem Solving from Nature - PPSN XV, 2018
Proceedings of the Genetic and Evolutionary Computation Conference, 2018
Runtime analysis of a population-based evolutionary algorithm with auxiliary objectives selected by reinforcement learning.
Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2018
2017
Runtime Analysis of Random Local Search on JUMP function with Reinforcement Based Selection of Auxiliary Objectives.
Proceedings of the 2017 IEEE Congress on Evolutionary Computation, 2017
2015
Runtime Analysis of (1+1) Evolutionary Algorithm Controlled with Q-learning Using Greedy Exploration Strategy on OneMax+ZeroMax Problem.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2015