Unbiased Black-Box Complexities of Jump Functions | Citedby Results | Evolutionary Computation | MIT Press

Skip to Main Content

Skip Nav Destination

Unbiased Black-Box Complexities of Jump Functions

Evolutionary Computation (2015) 23 (4): 641–670.

This article has been cited by the following articles in journals that are participating in Crossref Cited-by Linking.

Symmetry Breaking for Voting Mechanisms*

Preethi Sankineni
Andrew M. Sutton

Evolutionary Computation (2023) 31 (3): 309.

Runtime Analysis for Permutation-based Evolutionary Algorithms

Benjamin Doerr
Yassine Ghannane
Marouane Ibn Brahim

Algorithmica (2023)

Frequency Fitness Assignment: Optimization Without Bias for Good Solutions Can Be Efficient

Thomas Weise
Zhize Wu
Xinlu Li
Yan Chen
Jörg Lässig

IEEE Transactions on Evolutionary Computation (2023) 27 (4): 980.

Frequency Fitness Assignment: Making Optimization Algorithms Invariant Under Bijective Transformations of the Objective Function Value

Thomas Weise
Zhize Wu
Xinlu Li
Yan Chen

IEEE Transactions on Evolutionary Computation (2021) 25 (2): 307.

Precise Runtime Analysis for Plateau Functions

Denis Antipov
Benjamin Doerr

ACM Transactions on Evolutionary Learning and Optimization (2021) 1 (4): 1.