443 citations
- Centre National de la Recherche ScientifiqueFR470 papers
- École PolytechniqueFR434 papers
- Université Paris-SaclayFR210 papers
- Commissariat à l'Énergie Atomique et aux Énergies AlternativesFR177 papers
- Centre de Physique ThéoriqueFR131 papers
- Télécom SudParisFR124 papers
- Institut National de Physique Nucléaire et de Physique des ParticulesFR123 papers
- Laboratoire Leprince-RinguetFR123 papers
- Massachusetts Institute of TechnologyUS120 papers
- Télécom ParisFR115 papers
- Tsinghua UniversityCN109 papers
- Peking UniversityCN108 papers
12 papers · 2 filters
Finding optimal Pulse Repetion Intervals with Many-objective Evolutionary Algorithms
Paul Dufossé, Cyrille Enderli
In this paper we consider the problem of finding Pulse Repetition Intervals allowing the best compromises mitigating range and Doppler ambiguities in a Pulsed-Doppler radar system.…
Exploratory Landscape Analysis is Strongly Sensitive to the Sampling Strategy
Quentin Renau, Carola Doerr, Johann Dreo +1
Exploratory landscape analysis (ELA) supports supervised learning approaches for automated algorithm selection and configuration by providing sets of features that quantify the mos…
A Survey on Recent Progress in the Theory of Evolutionary Algorithms for Discrete Optimization
Benjamin Doerr, Frank Neumann
The theory of evolutionary computation for discrete search spaces has made significant progress in the last ten years. This survey summarizes some of the most important recent resu…
First Steps Towards a Runtime Analysis When Starting With a Good Solution
Denis Antipov, Maxim Buzdalov, Benjamin Doerr
The mathematical runtime analysis of evolutionary algorithms traditionally regards the time an algorithm needs to find a solution of a certain quality when initialized with a rando…
Runtime Analysis of Evolutionary Algorithms via Symmetry Arguments
Benjamin Doerr
We use an elementary argument building on group actions to prove that the selection-free steady state genetic algorithm analyzed by Sutton and Witt (GECCO 2019) takes an expected n…
Lower Bounds for Non-Elitist Evolutionary Algorithms via Negative Multiplicative Drift
Benjamin Doerr
A decent number of lower bounds for non-elitist population-based evolutionary algorithms has been shown by now. Most of them are technically demanding due to the (hard to avoid) us…