Maxim Buzdalov

ORCID

Publication Activity (10 Years)

Years Active: 2011-2024
Publications (10 Years): 70

Top Venues

Publications

Denis Antipov, Maxim Buzdalov, Benjamin Doerr
Lazy Parameter Tuning and Control: Choosing All Parameters Randomly from a Power-Law Distribution. Algorithmica 86 (2) (2024)
Aidan Walden, Maxim Buzdalov
A Simple Statistical Test Against Origin-Biased Metaheuristics. EvoApplications@EvoStar (2024)
Maxim Buzdalov, Pavel Martynov, Sergey Pankratov, Vitaly Aksenov, Stefan Schmid
In the Search of Optimal Tree Networks: Hardness and Heuristics. CoRR (2024)
Deyao Chen, Maxim Buzdalov, Carola Doerr, Nguyen Dang
Using Automated Algorithm Configuration for Parameter Control. FOGA (2023)
Deyao Chen, Maxim Buzdalov, Carola Doerr, Nguyen Dang
Using Automated Algorithm Configuration for Parameter Control. CoRR (2023)
Maxim Buzdalov
Improving Time and Memory Efficiency of Genetic Algorithms by Storing Populations as Minimum Spanning Trees of Patches. CoRR (2023)
Maxim Buzdalov
Improving Time and Memory Efficiency of Genetic Algorithms by Storing Populations as Minimum Spanning Trees of Patches. GECCO Companion (2023)
Maxim Buzdalov
The $(1+(\lambda, \lambda))$ Genetic Algorithm on the Vertex Cover Problem: Crossover Helps Leaving Plateaus. CEC (2022)
Dmitry Vinokurov, Maxim Buzdalov
Towards Fixed-Target Black-Box Complexity Analysis. PPSN (2) (2022)
Dmitry Vinokurov, Maxim Buzdalov
On optimal static and dynamic parameter choices for fixed-target optimization. GECCO (2022)
Maxim Buzdalov, Benjamin Doerr, Carola Doerr, Dmitry Vinokurov
Fixed-Target Runtime Analysis. Algorithmica 84 (6) (2022)
Denis Antipov, Maxim Buzdalov, Benjamin Doerr
Fast Mutation in Crossover-Based Algorithms. Algorithmica 84 (6) (2022)
Kirill Antonov, Maxim Buzdalov, Arina Buzdalova, Carola Doerr
Blending Dynamic Programming with Monte Carlo Simulation for Bounding the Running Time of Evolutionary Algorithms. CEC (2021)
Denis Antipov, Maxim Buzdalov, Benjamin Doerr
Lazy Parameter Tuning and Control: Choosing All Parameters Randomly From a Power-Law Distribution. CoRR (2021)
Kirill Antonov, Maxim Buzdalov, Arina Buzdalova, Carola Doerr
Blending Dynamic Programming with Monte Carlo Simulation for Bounding the Running Time of Evolutionary Algorithms. CoRR (2021)
Denis Antipov, Maxim Buzdalov, Benjamin Doerr
Lazy parameter tuning and control: choosing all parameters randomly from a power-law distribution. GECCO (2021)
Sumit Mishra, Ved Prakash, Maxim Buzdalov
). GECCO Companion (2021)
Maxim Buzdalov, Carola Doerr
) evolutionary algorithm on OneMax. GECCO (2021)
Maxim Buzdalov, Carola Doerr
Optimal Static Mutation Strength Distributions for the (1+λ) Evolutionary Algorithm on OneMax. CoRR (2021)
Anton O. Bassin, Maxim Buzdalov
The $(1+(λ, λ))$ Genetic Algorithm for Permutations. CoRR (2020)
Denis Antipov, Maxim Buzdalov, Benjamin Doerr
Fast Mutation in Crossover-based Algorithms. CoRR (2020)
Maxim Buzdalov, Sergey A. Kolyubin, Artem A. Egorov, Ivan I. Borisov
Optimizing Robotic Cheetah Leg Parameters Using Evolutionary Algorithms. BIOMA (2020)
Maxim Buzdalov, Benjamin Doerr, Carola Doerr, Dmitry Vinokurov
Fixed-Target Runtime Analysis. CoRR (2020)
Sumit Mishra, Maxim Buzdalov, Rakesh Senwar
Time complexity analysis of the dominance degree approach for non-dominated sorting. GECCO Companion (2020)
Sumit Mishra, Maxim Buzdalov
) in expectation over input permutations. GECCO (2020)
Maxim Buzdalov, Benjamin Doerr, Carola Doerr, Dmitry Vinokurov
Fixed-target runtime analysis. GECCO (2020)
Denis Antipov, Maxim Buzdalov, Benjamin Doerr
First Steps Towards a Runtime Analysis When Starting With a Good Solution. CoRR (2020)
Anton O. Bassin, Maxim Buzdalov
)) genetic algorithm for permutations. GECCO Companion (2020)
Maxim Buzdalov, Carola Doerr
Optimal Mutation Rates for the (1+λ ) EA on OneMax. PPSN (2) (2020)
Sumit Mishra, Maxim Buzdalov
Filter Sort Is $\varOmega (N^3)$ in the Worst Case. PPSN (2) (2020)
Denis Antipov, Maxim Buzdalov, Benjamin Doerr
Fast mutation in crossover-based algorithms. GECCO (2020)
Denis Antipov, Maxim Buzdalov, Benjamin Doerr
First Steps Towards a Runtime Analysis When Starting with a Good Solution. PPSN (2) (2020)
Maxim Buzdalov, Carola Doerr
Optimal Mutation Rates for the (1+λ) EA on OneMax. CoRR (2020)
Maxim Buzdalov
Make Evolutionary Multiobjective Algorithms Scale Better with Advanced Data Structures: Van Emde Boas Tree for Non-dominated Sorting. EMO (2019)
Anton O. Bassin, Maxim Buzdalov
The 1/5-th Rule with Rollbacks: On Self-Adjustment of the Population Size in the (1+(λ, λ)) GA. CoRR (2019)
Ivan Ignashov, Arina Buzdalova, Maxim Buzdalov, Carola Doerr
Illustrating the trade-off between time, quality, and success probability in heuristic search: a discussion paper. GECCO (Companion) (2019)
Nina Bulanova, Maxim Buzdalov
Black-Box Complexity of the Binary Value Function. CoRR (2019)
Maxim Buzdalov
Towards better estimation of statistical significance when comparing evolutionary algorithms. GECCO (Companion) (2019)
Nina Bulanova, Maxim Buzdalov
Limited memory, limited arity unbiased black-box complexity: first insights. GECCO (Companion) (2019)
Artem Pavlenko, Maxim Buzdalov, Vladimir Ulyantsev
Fitness comparison by statistical testing in construction of SAT-based guess-and-determine cryptographic attacks. GECCO (2019)
Dmitry Vinokurov, Maxim Buzdalov, Arina Buzdalova, Benjamin Doerr, Carola Doerr
Fixed-target runtime analysis of the (1 + 1) EA with resampling. GECCO (Companion) (2019)
Anton O. Bassin, Maxim Buzdalov
)) GA. GECCO (Companion) (2019)
Maxim Buzdalov
Generalized incremental orthant search: towards efficient steady-state evolutionary multiobjective algorithms. GECCO (Companion) (2019)
Vladimir Mironovich, Maxim Buzdalov, Valeriy Vyatkin
Permutation Encoding for Automatic Reconstruction of Connections in Closed-Loop Control System using Evolutionary Algorithm. ETFA (2019)
Nina Bulanova, Maxim Buzdalov
Black-box complexity of the binary value function. GECCO (Companion) (2019)
Margarita Markina, Maxim Buzdalov
Towards Large-Scale Multiobjective Optimisation with a Hybrid Algorithm for Non-dominated Sorting. PPSN (1) (2018)
Nina Bulanova, Maxim Buzdalov
Better Fixed-Arity Unbiased Black-Box Algorithms. CoRR (2018)
Nina Bulanova, Maxim Buzdalov
Better fixed-arity unbiased black-box algorithms. GECCO (Companion) (2018)
Ilya Yakupov, Maxim Buzdalov
On asynchronous non-dominated sorting for steady-state multiobjective evolutionary algorithms. GECCO (Companion) (2018)
Maxim Buzdalov
Generalized offline orthant search: one code for many problems in multiobjective optimization. GECCO (2018)
Vladimir Mironovich, Maxim Buzdalov, Valeriy Vyatkin
From fitness landscape analysis to designing evolutionary algorithms: the case study in automatic generation of function block applications. GECCO (Companion) (2018)
Vladimir Mironovich, Maxim Buzdalov, Valeriy Vyatkin
Automatic Plant-Controller Input/Output Matching using Evolutionary Algorithms. ETFA (2018)
Ilya Yakupov, Maxim Buzdalov
On Asynchronous Non-Dominated Sorting for Steady-State Multiobjective Evolutionary Algorithms. CoRR (2018)
Margarita Markina, Maxim Buzdalov
Hybridizing Non-dominated Sorting Algorithms: Divide-and-Conquer Meets Best Order Sort. CoRR (2017)
Maxim Buzdalov, Benjamin Doerr, Mikhail Kever
The unrestricted black-box complexity of jump functions. GECCO (Companion) (2017)
Ilya Yakupov, Maxim Buzdalov
Improved incremental non-dominated sorting for steady-state evolutionary multiobjective optimization. GECCO (2017)
Vladimir Mironovich, Maxim Buzdalov, Valeriy Vyatkin
Automatic generation of function block applications using evolutionary algorithms: Initial explorations. INDIN (2017)
Maxim Buzdalov, Benjamin Doerr
)) genetic algorithm on random satisfiable 3-CNF formulas. GECCO (2017)
Nina Bulanova, Maxim Buzdalov
On binary unbiased operators returning multiple offspring. GECCO (Companion) (2017)
Maxim Buzdalov, Benjamin Doerr
Runtime Analysis of the (1+(λ, λ)) Genetic Algorithm on Random Satisfiable 3-CNF Formulas. CoRR (2017)
Margarita Markina, Maxim Buzdalov
Hybridizing non-dominated sorting algorithms: divide-and-conquer meets best order sort. GECCO (Companion) (2017)
Vladimir Mironovich, Maxim Buzdalov
Evaluation of heavy-tailed mutation operator on maximum flow test generation problem. GECCO (Companion) (2017)
Niyaz Nigmatullin, Maxim Buzdalov, Andrey Stankevich
Efficient Removal of Points with Smallest Crowding Distance in Two-dimensional Incremental Non-dominated Sorting. GECCO (Companion) (2016)
Maxim Buzdalov, Benjamin Doerr, Mikhail Kever
The Unrestricted Black-Box Complexity of Jump Functions. Evol. Comput. 24 (4) (2016)
Arina Buzdalova, Irina Petrova, Maxim Buzdalov
Runtime analysis of different Approaches to select conflicting auxiliary objectives in the generalized OneMax problem. SSCI (2016)
Maxim Buzdalov
GECCO'16 Workshop on Algorithms and Data Structures for Evolutionary Computation Chairs' Welcome. GECCO (Companion) (2016)
Tatyana Polevaya, Maxim Buzdalov
Preserving diversity in auxiliary objectives provably speeds up crossing plateaus. SSCI (2016)
Andrey Vasin, Maxim Buzdalov
A Faster Algorithm for the Binary Epsilon Indicator Based on Orthant Minimum Search. GECCO (2016)
Maxim Buzdalov
An Algorithm for Computing Lower Bounds for Unrestricted Black-Box Complexities. GECCO (Companion) (2016)
Nina Bulanova, Arina Buzdalova, Maxim Buzdalov
Fitness-Dependent Hybridization of Clonal Selection Algorithm and Random Local Search. GECCO (Companion) (2016)
Maxim Buzdalov, Mikhail Kever, Benjamin Doerr
Upper and Lower Bounds on Unrestricted Black-Box Complexity of Jump _n, ℓ. EvoCOP (2015)
Viktor Arkhipov, Maxim Buzdalov, Anatoly Shalyto
An Asynchronous Implementation of the Limited Memory CMA-ES. ICMLA (2015)
Maxim Buzdalov, Arina Buzdalova
Can OneMax help optimizing LeadingOnes using the EA+RL method? CEC (2015)
Viktor Arkhipov, Maxim Buzdalov, Anatoly Shalyto
An Asynchronous Implementation of the Limited Memory CMA-ES. CoRR (2015)
Maxim Buzdalov, Vladimir Parfenov
Various Degrees of Steadiness in NSGA-II and Their Influence on the Quality of Results. GECCO (Companion) (2015)
Maxim Buzdalov, Anatoly Shalyto
Hard test generation for augmenting path maximum flow algorithms using genetic algorithms: Revisited. CEC (2015)
Maxim Buzdalov, Ilya Yakupov, Andrey Stankevich
Fast Implementation of the Steady-State NSGA-II Algorithm for Two Dimensions Based on Incremental Non-Dominated Sorting. GECCO (2015)
Vladimir Mironovich, Maxim Buzdalov
Hard Test Generation for Maximum Flow Algorithms with the Fast Crossover-Based Evolutionary Algorithm. GECCO (Companion) (2015)
Denis Antipov, Maxim Buzdalov, Benjamin Doerr
Runtime Analysis of (1+1) Evolutionary Algorithm Controlled with Q-learning Using Greedy Exploration Strategy on OneMax+ZeroMax Problem. EvoCOP (2015)
Ilya Yakupov, Maxim Buzdalov
Incremental non-dominated sorting with O(N) insertion for the two-dimensional case. CEC (2015)
Maxim Buzdalov, Arina Buzdalova
Analysis of Q-learning with random exploration for selection of auxiliary objectives in random local search. CEC (2015)
Maxim Buzdalov, Arina Buzdalova
Onemax helps optimizing XdivK: : theoretical runtime analysis for RLS and EA+RL. GECCO (Companion) (2014)
Maxim Buzdalov, Anatoly Shalyto
Worst-Case Execution Time Test Generation for Solutions of the Knapsack Problem Using a Genetic Algorithm. BIC-TA (2014)
Irina Petrova, Arina Buzdalova, Maxim Buzdalov
Improved Selection of Auxiliary Objectives Using Reinforcement Learning in Non-stationary Environment. ICMLA (2014)
Maxim Buzdalov, Sergey Knyazev, Yuri Porozov
Protein Conformation Motion Modeling Using Sep-CMA-ES. ICMLA (2014)
Maxim Buzdalov
A Switch-and-Restart Algorithm with Exponential Restart Strategy for Objective Selection and its Runtime Analysis. ICMLA (2014)
Maxim Buzdalov, Anatoly Shalyto
A Provably Asymptotically Fast Version of the Generalized Jensen Algorithm for Non-dominated Sorting. PPSN (2014)
Mikhail Lukin, Maxim Buzdalov, Anatoly Shalyto
Formal Verification of 800 Genetically Constructed Automata Programs: A Case Study. Haifa Verification Conference (2014)
Arina Buzdalova, Vladislav Kononov, Maxim Buzdalov
Selecting evolutionary operators using reinforcement learning: initial explorations. GECCO (Companion) (2014)
Maxim Buzdalov, Irina Petrova, Arina Buzdalova
NSGA-II implementation details may influence quality of solutions for the job-shop scheduling problem. GECCO (Companion) (2014)
Arina Buzdalova, Maxim Buzdalov
A New Algorithm for Adaptive Online Selection of Auxiliary Objectives. ICMLA (2014)
Maxim Buzdalov, Arina Buzdalova, Irina Petrova
Generation of tests for programming challenge tasks using multi-objective optimization. GECCO (Companion) (2013)
Irina Petrova, Arina Buzdalova, Maxim Buzdalov
Improved Helper-Objective Optimization Strategy for Job-Shop Scheduling Problem. ICMLA (2) (2013)
Maxim Buzdalov, Arina Buzdalova
Adaptive selection of helper-objectives for test case generation. IEEE Congress on Evolutionary Computation (2013)
Maxim Buzdalov, Arina Buzdalova, Anatoly Shalyto
A First Step towards the Runtime Analysis of Evolutionary Algorithm Adjusted with Reinforcement Learning. ICMLA (1) (2013)
Arina Buzdalova, Maxim Buzdalov, Vladimir Parfenov
Generation of Tests for Programming Challenge Tasks Using Helper-Objectives. SSBSE (2013)
Viktor Arkhipov, Maxim Buzdalov, Anatoly Shalyto
Worst-Case Execution Time Test Generation for Augmenting Path Maximum Flow Algorithms Using Genetic Algorithms. ICMLA (2) (2013)
Arina Buzdalova, Maxim Buzdalov
Increasing Efficiency of Evolutionary Algorithms by Choosing between Auxiliary Fitness Functions with Reinforcement Learning. ICMLA (1) (2012)
Maxim Buzdalov
Generation of Tests for Programming Challenge Tasks on Graph Theory Using Evolution Strategy. ICMLA (2) (2012)
Arina Buzdalova, Maxim Buzdalov
Adaptive Selection of Helper-Objectives with Reinforcement Learning. ICMLA (2) (2012)

Maxim Buzdalov.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Maxim Buzdalov