Solving Problems with Unknown Solution Length at (Almost) No Extra Cost

19 June 2015

Papers citing "Solving Problems with Unknown Solution Length at (Almost) No Extra Cost"

11 / 11 papers shown

Run Time Bounds for Integer-Valued OneMax FunctionsAnnual Conference on Genetic and Evolutionary Computation (GECCO), 2023

Jonathan Gadea Harder

Timo Kotzing

Xiaoyue Li

Aishwarya Radhakrishnan

359

21 Jul 2023

Analysing Equilibrium States for Population DiversityAnnual Conference on Genetic and Evolutionary Computation (GECCO), 2023

Johannes Lengler

Andre Opris

Dirk Sudholt

134

19 Apr 2023

An Extended Jump Functions Benchmark for the Analysis of Randomized Search Heuristics

Henry Bambury

Antoine Bultel

Benjamin Doerr

429

07 May 2021

Lazy Parameter Tuning and Control: Choosing All Parameters Randomly From a Power-Law DistributionAnnual Conference on Genetic and Evolutionary Computation (GECCO), 2021

Denis Antipov

M. Buzdalov

Benjamin Doerr

390

14 Apr 2021

A Survey on Recent Progress in the Theory of Evolutionary Algorithms for Discrete Optimization

Benjamin Doerr

Frank Neumann

392

30 Jun 2020

Self-adaptation in non-Elitist Evolutionary Algorithms on Discrete Problems with Unknown StructureIEEE Transactions on Evolutionary Computation (TEVC), 2020

B. Case

Per Kristian Lehre

203

01 Apr 2020

The linear hidden subset problem for the (1+1) EA with scheduled and adaptive mutation rates

139

16 Aug 2018

Analysis of Evolutionary Algorithms in Dynamic and Stochastic Environments

Vahid Roostapour

M. Pourhassan

Frank Neumann

129

22 Jun 2018

Complexity Theory for Discrete Black-Box Optimization Heuristics

Carola Doerr

339

06 Jan 2018

The (1+

λ

) Evolutionary Algorithm with Self-Adjusting Mutation Rate

238

07 Apr 2017

Self-adaptation of Mutation Rates in Non-elitist Populations

D. Dang

Per Kristian Lehre

299

17 Jun 2016