Unbiased Black-Box Complexities of Jump Functions.

Abstract excerpt

We analyze the unbiased black-box complexities of jump functions with small, medium, and large sizes of the fitness plateau surrounding the optimal solution. Among other results, we show that when the jump size is (1/2 - ε), that is, when only a small constant fraction of the fitness values is visible, then the unbiased black-box complexities for arities 3 and higher are of the same order as those for the simple...

Topics

Share this publication in a Topic to start or enrich a Post.

• Share to Algorithms
• Share to Biological Evolution
• Share to Computational Biology