Maxim Buzdalov

Algorithmica, February, 2024

In the Search of Optimal Tree Networks: Hardness and Heuristics.

[BibT_eX]

[DOI]

CoRR, 2024

A Simple Statistical Test Against Origin-Biased Metaheuristics.

[BibT_eX]

[DOI]

Aidan Walden

Proceedings of the Applications of Evolutionary Computation - 27th European Conference, 2024

2023

Improving Time and Memory Efficiency of Genetic Algorithms by Storing Populations as Minimum Spanning Trees of Patches.

[BibT_eX]

[DOI]

Proceedings of the Companion Proceedings of the Conference on Genetic and Evolutionary Computation, 2023

Using Automated Algorithm Configuration for Parameter Control.

[BibT_eX]

[DOI]

Proceedings of the 17th ACM/SIGEVO Conference on Foundations of Genetic Algorithms, 2023

2022

Fixed-Target Runtime Analysis.

[BibT_eX]

[DOI]

Algorithmica, 2022

Fast Mutation in Crossover-Based Algorithms.

[BibT_eX]

[DOI]

Algorithmica, 2022

Towards Fixed-Target Black-Box Complexity Analysis.

[BibT_eX]

[DOI]

Dmitry Vinokurov

Proceedings of the Parallel Problem Solving from Nature - PPSN XVII, 2022

On optimal static and dynamic parameter choices for fixed-target optimization.

[BibT_eX]

[DOI]

Dmitry Vinokurov

Proceedings of the GECCO '22: Genetic and Evolutionary Computation Conference, Boston, Massachusetts, USA, July 9, 2022

The $(1+(\lambda, \lambda))$ Genetic Algorithm on the Vertex Cover Problem: Crossover Helps Leaving Plateaus.

[BibT_eX]

[DOI]

Proceedings of the IEEE Congress on Evolutionary Computation, 2022

2021

Optimal Static Mutation Strength Distributions for the (1+λ) Evolutionary Algorithm on OneMax.

[BibT_eX]

[DOI]

Carola Doerr

CoRR, 2021

The "One-Fifth Rule" with Rollbacks for Self-Adjustment of the Population Size in the (1 + (λ, λ)) Genetic Algorithm.

[BibT_eX]

[DOI]

Maxim V. Buzdalov

Anatoly A. Shalyto

Autom. Control. Comput. Sci., 2021

Labeling-oriented non-dominated sorting is Θ(MN3).

[BibT_eX]

[DOI]

Ved Prakash

Proceedings of the GECCO '21: Genetic and Evolutionary Computation Conference, 2021

Optimal static mutation strength distributions for the (1 + λ) evolutionary algorithm on OneMax.

[BibT_eX]

[DOI]

Carola Doerr

Proceedings of the GECCO '21: Genetic and Evolutionary Computation Conference, 2021

Blending Dynamic Programming with Monte Carlo Simulation for Bounding the Running Time of Evolutionary Algorithms.

[BibT_eX]

[DOI]

Proceedings of the IEEE Congress on Evolutionary Computation, 2021

2020

The $(1+(λ, λ))$ Genetic Algorithm for Permutations.

[BibT_eX]

[DOI]

CoRR, 2020

Filter Sort Is $\varOmega (N^3)$ in the Worst Case.

[BibT_eX]

[DOI]

Proceedings of the Parallel Problem Solving from Nature - PPSN XVI, 2020

Optimal Mutation Rates for the (1+λ ) EA on OneMax.

[BibT_eX]

[DOI]

Carola Doerr

Proceedings of the Parallel Problem Solving from Nature - PPSN XVI, 2020

First Steps Towards a Runtime Analysis When Starting with a Good Solution.

[BibT_eX]

[DOI]

Proceedings of the Parallel Problem Solving from Nature - PPSN XVI, 2020

Time complexity analysis of the dominance degree approach for non-dominated sorting.

[BibT_eX]

[DOI]

Rakesh Senwar

Proceedings of the GECCO '20: Genetic and Evolutionary Computation Conference, 2020

If unsure, shuffle: deductive sort is Θ(MN3), but O(MN2) in expectation over input permutations.

[BibT_eX]

[DOI]

Proceedings of the GECCO '20: Genetic and Evolutionary Computation Conference, 2020

The (1 + (λ, λ)) genetic algorithm for permutations.

[BibT_eX]

[DOI]

Proceedings of the GECCO '20: Genetic and Evolutionary Computation Conference, 2020

Optimizing Robotic Cheetah Leg Parameters Using Evolutionary Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Bioinspired Optimization Methods and Their Applications, 2020

2019

The 1/5-th Rule with Rollbacks: On Self-Adjustment of the Population Size in the (1+(λ, λ)) GA.

[BibT_eX]

[DOI]

CoRR, 2019

Fixed-target runtime analysis of the (1 + 1) EA with resampling.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2019

Fitness comparison by statistical testing in construction of SAT-based guess-and-determine cryptographic attacks.

[BibT_eX]

[DOI]

Artem Pavlenko

Vladimir Ulyantsev

Proceedings of the Genetic and Evolutionary Computation Conference, 2019

Illustrating the trade-off between time, quality, and success probability in heuristic search: a discussion paper.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2019

Towards better estimation of statistical significance when comparing evolutionary algorithms.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2019

Generalized incremental orthant search: towards efficient steady-state evolutionary multiobjective algorithms.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2019

Limited memory, limited arity unbiased black-box complexity: first insights.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2019

Black-box complexity of the binary value function.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2019

The 1/5-th rule with rollbacks: on self-adjustment of the population size in the (1 + (λ, λ)) GA.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2019

Permutation Encoding for Automatic Reconstruction of Connections in Closed-Loop Control System using Evolutionary Algorithm.

[BibT_eX]

[DOI]

Proceedings of the 24th IEEE International Conference on Emerging Technologies and Factory Automation, 2019

Make Evolutionary Multiobjective Algorithms Scale Better with Advanced Data Structures: Van Emde Boas Tree for Non-dominated Sorting.

[BibT_eX]

[DOI]

Proceedings of the Evolutionary Multi-Criterion Optimization, 2019

2018

Towards Large-Scale Multiobjective Optimisation with a Hybrid Algorithm for Non-dominated Sorting.

[BibT_eX]

[DOI]

Margarita Markina

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

On asynchronous non-dominated sorting for steady-state multiobjective evolutionary algorithms.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2018

From fitness landscape analysis to designing evolutionary algorithms: the case study in automatic generation of function block applications.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2018

Generalized offline orthant search: one code for many problems in multiobjective optimization.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference, 2018

Better fixed-arity unbiased black-box algorithms.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2018

Automatic Plant-Controller Input/Output Matching using Evolutionary Algorithms.

[BibT_eX]

[DOI]

Proceedings of the 23rd IEEE International Conference on Emerging Technologies and Factory Automation, 2018

2017

Runtime Analysis of the (1+(λ, λ)) Genetic Algorithm on Random Satisfiable 3-CNF Formulas.

[BibT_eX]

[DOI]

CoRR, 2017

Automatic generation of function block applications using evolutionary algorithms: Initial explorations.

[BibT_eX]

[DOI]

Proceedings of the 15th IEEE International Conference on Industrial Informatics, 2017

Improved incremental non-dominated sorting for steady-state evolutionary multiobjective optimization.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference, 2017

Evaluation of heavy-tailed mutation operator on maximum flow test generation problem.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference, 2017

Hybridizing non-dominated sorting algorithms: divide-and-conquer meets best order sort.

[BibT_eX]

[DOI]

Margarita Markina

Proceedings of the Genetic and Evolutionary Computation Conference, 2017

Runtime analysis of the (1 + (λ, λ)) genetic algorithm on random satisfiable 3-CNF formulas.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference, 2017

On binary unbiased operators returning multiple offspring.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference, 2017

2016

The Unrestricted Black-Box Complexity of Jump Functions.

[BibT_eX]

[DOI]

Mikhail Kever

Evol. Comput., 2016

Preserving diversity in auxiliary objectives provably speeds up crossing plateaus.

[BibT_eX]

[DOI]

Tatyana Polevaya

Proceedings of the 2016 IEEE Symposium Series on Computational Intelligence, 2016

Runtime analysis of different Approaches to select conflicting auxiliary objectives in the generalized OneMax problem.

[BibT_eX]

[DOI]

Proceedings of the 2016 IEEE Symposium Series on Computational Intelligence, 2016

A Faster Algorithm for the Binary Epsilon Indicator Based on Orthant Minimum Search.

[BibT_eX]

[DOI]

Andrey Vasin

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

Efficient Removal of Points with Smallest Crowding Distance in Two-dimensional Incremental Non-dominated Sorting.

[BibT_eX]

[DOI]

Niyaz Nigmatullin

Andrey Stankevich

Proceedings of the Genetic and Evolutionary Computation Conference, 2016

GECCO'16 Workshop on Algorithms and Data Structures for Evolutionary Computation Chairs' Welcome.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference, 2016

An Algorithm for Computing Lower Bounds for Unrestricted Black-Box Complexities.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference, 2016

Fitness-Dependent Hybridization of Clonal Selection Algorithm and Random Local Search.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference, 2016

2015

An Asynchronous Implementation of the Limited Memory CMA-ES.

[BibT_eX]

[DOI]

Viktor Arkhipov

Proceedings of the 14th IEEE International Conference on Machine Learning and Applications, 2015

Hard Test Generation for Maximum Flow Algorithms with the Fast Crossover-Based Evolutionary Algorithm.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference, 2015

Fast Implementation of the Steady-State NSGA-II Algorithm for Two Dimensions Based on Incremental Non-Dominated Sorting.

[BibT_eX]

[DOI]

Andrey Stankevich

Proceedings of the Genetic and Evolutionary Computation Conference, 2015

Various Degrees of Steadiness in NSGA-II and Their Influence on the Quality of Results.

[BibT_eX]

[DOI]

Vladimir Parfenov

Proceedings of the Genetic and Evolutionary Computation Conference, 2015

Upper and Lower Bounds on Unrestricted Black-Box Complexity of Jump _n, ℓ.

[BibT_eX]

[DOI]

Mikhail Kever

Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2015

Runtime Analysis of (1+1) Evolutionary Algorithm Controlled with Q-learning Using Greedy Exploration Strategy on OneMax+ZeroMax Problem.

[BibT_eX]

[DOI]

Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2015

Incremental non-dominated sorting with O(N) insertion for the two-dimensional case.

[BibT_eX]

[DOI]

Proceedings of the IEEE Congress on Evolutionary Computation, 2015

Hard test generation for augmenting path maximum flow algorithms using genetic algorithms: Revisited.

[BibT_eX]

[DOI]

Proceedings of the IEEE Congress on Evolutionary Computation, 2015

Can OneMax help optimizing LeadingOnes using the EA+RL method?

[BibT_eX]

[DOI]

Proceedings of the IEEE Congress on Evolutionary Computation, 2015

Analysis of Q-learning with random exploration for selection of auxiliary objectives in random local search.

[BibT_eX]

[DOI]

Proceedings of the IEEE Congress on Evolutionary Computation, 2015

2014

A Provably Asymptotically Fast Version of the Generalized Jensen Algorithm for Non-dominated Sorting.

[BibT_eX]

[DOI]

Proceedings of the Parallel Problem Solving from Nature - PPSN XIII, 2014

Improved Selection of Auxiliary Objectives Using Reinforcement Learning in Non-stationary Environment.

[BibT_eX]

[DOI]

Proceedings of the 13th International Conference on Machine Learning and Applications, 2014

A New Algorithm for Adaptive Online Selection of Auxiliary Objectives.

[BibT_eX]

[DOI]

Proceedings of the 13th International Conference on Machine Learning and Applications, 2014

Protein Conformation Motion Modeling Using Sep-CMA-ES.

[BibT_eX]

[DOI]

Sergey Knyazev

Yuri Porozov

Proceedings of the 13th International Conference on Machine Learning and Applications, 2014

A Switch-and-Restart Algorithm with Exponential Restart Strategy for Objective Selection and its Runtime Analysis.

[BibT_eX]

[DOI]

Proceedings of the 13th International Conference on Machine Learning and Applications, 2014

Formal Verification of 800 Genetically Constructed Automata Programs: A Case Study.

[BibT_eX]

[DOI]

Mikhail Lukin

Proceedings of the Hardware and Software: Verification and Testing, 2014

Selecting evolutionary operators using reinforcement learning: initial explorations.

[BibT_eX]

[DOI]

Vladislav Kononov

Proceedings of the Genetic and Evolutionary Computation Conference, 2014

NSGA-II implementation details may influence quality of solutions for the job-shop scheduling problem.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference, 2014

Onemax helps optimizing XdivK: : theoretical runtime analysis for RLS and EA+RL.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference, 2014

Worst-Case Execution Time Test Generation for Solutions of the Knapsack Problem Using a Genetic Algorithm.

[BibT_eX]

[DOI]

Proceedings of the Bio-Inspired Computing - Theories and Applications, 2014

2013

Generation of Tests for Programming Challenge Tasks Using Helper-Objectives.

[BibT_eX]

[DOI]

Vladimir Parfenov

Proceedings of the Search Based Software Engineering - 5th International Symposium, 2013

Improved Helper-Objective Optimization Strategy for Job-Shop Scheduling Problem.

[BibT_eX]

[DOI]

Proceedings of the 12th International Conference on Machine Learning and Applications, 2013

A First Step towards the Runtime Analysis of Evolutionary Algorithm Adjusted with Reinforcement Learning.

[BibT_eX]

[DOI]

Proceedings of the 12th International Conference on Machine Learning and Applications, 2013

Worst-Case Execution Time Test Generation for Augmenting Path Maximum Flow Algorithms Using Genetic Algorithms.

[BibT_eX]

[DOI]

Viktor Arkhipov

Proceedings of the 12th International Conference on Machine Learning and Applications, 2013

Generation of tests for programming challenge tasks using multi-objective optimization.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference, 2013

Adaptive selection of helper-objectives for test case generation.

[BibT_eX]

[DOI]

Proceedings of the IEEE Congress on Evolutionary Computation, 2013

2012

Adaptive Selection of Helper-Objectives with Reinforcement Learning.

[BibT_eX]

[DOI]

Proceedings of the 11th International Conference on Machine Learning and Applications, 2012

Increasing Efficiency of Evolutionary Algorithms by Choosing between Auxiliary Fitness Functions with Reinforcement Learning.

[BibT_eX]

[DOI]

Proceedings of the 11th International Conference on Machine Learning and Applications, 2012

Generation of Tests for Programming Challenge Tasks on Graph Theory Using Evolution Strategy.

[BibT_eX]

[DOI]

Proceedings of the 11th International Conference on Machine Learning and Applications, 2012

Evolving EFSMs solving a path-planning problem by genetic programming.

[BibT_eX]

[DOI]

Andrey Sokolov

Proceedings of the Genetic and Evolutionary Computation Conference, 2012

2011

Choosing Best Fitness Function with Reinforcement Learning.

[BibT_eX]

[DOI]

Arina Afanasyeva

Proceedings of the 10th International Conference on Machine Learning and Applications and Workshops, 2011

Generation of tests for programming challenge tasks using evolution algorithms.

[BibT_eX]

[DOI]