Faster Black-Box Algorithms Through Higher Arity Operators

Faster Black-Box Algorithms Through Higher Arity Operators

4 December 2010

Daniel Johannsen

Per Kristian Lehre

ArXiv (abs)PDF HTML

Papers citing "Faster Black-Box Algorithms Through Higher Arity Operators"

17 / 17 papers shown

Title
Improving Time and Memory Efficiency of Genetic Algorithms by Storing Populations as Minimum Spanning Trees of Patches M. Buzdalov 55 1 0 29 Jun 2023
Choosing the Right Algorithm With Hints From Complexity Theory Shouda Wang Weijie Zheng Benjamin Doerr 117 17 0 14 Sep 2021
First Steps Towards a Runtime Analysis When Starting With a Good Solution Denis Antipov M. Buzdalov Benjamin Doerr 46 20 0 22 Jun 2020
The $(1+(λ,λ))$ Genetic Algorithm for Permutations Anton O. Bassin M. Buzdalov 34 16 0 18 Apr 2020
On Non-Elitist Evolutionary Algorithms Optimizing Fitness Functions with a Plateau A. Eremeev 16 3 0 18 Apr 2020
Benchmarking Discrete Optimization Heuristics with IOHprofiler Carola Doerr Furong Ye Naama Horesh Hao Wang O. M. Shir Thomas Bäck 91 73 0 19 Dec 2019
Black-Box Complexity of the Binary Value Function Nina Bulanova M. Buzdalov FAtt 62 0 0 09 Apr 2019
The Query Complexity of a Permutation-Based Variant of Mastermind P. Afshani Manindra Agrawal Benjamin Doerr Carola Doerr Kasper Green Larsen K. Mehlhorn LRM 45 16 0 20 Dec 2018
Better Fixed-Arity Unbiased Black-Box Algorithms Nina Bulanova M. Buzdalov 18 0 0 15 Apr 2018
Probabilistic Tools for the Analysis of Randomized Optimization Heuristics Benjamin Doerr 53 173 0 20 Jan 2018
Introducing Elitist Black-Box Models: When Does Elitist Selection Weaken the Performance of Evolutionary Algorithms? Carola Doerr Johannes Lengler 47 7 0 27 Aug 2015
OneMax in Black-Box Models with Several Restrictions Carola Doerr Johannes Lengler 57 22 0 10 Apr 2015
$Black-Box Complexity: Breaking the $O(n \log n)$ Barrier of LeadingOnes$ Black-Box Complexity: Breaking the $O(n \log n)$ Barrier of LeadingOnes Benjamin Doerr Carola Doerr 88 16 0 24 Oct 2012
Reducing the Arity in Unbiased Black-Box Complexity Benjamin Doerr Carola Doerr 64 31 0 19 Mar 2012
A New Method for Lower Bounds on the Running Time of Evolutionary Algorithms Dirk Sudholt 70 157 0 07 Sep 2011
Black-Box Complexities of Combinatorial Problems Benjamin Doerr Timo Kotzing Johannes Lengler Carola Doerr 87 39 0 01 Aug 2011
Ranking-Based Black-Box Complexity Benjamin Doerr Carola Doerr 72 35 0 06 Feb 2011