arXiv cs.NE
· Papers
Asymptotical Analysis of the $(1+(lambda,lambda))$ GA Escape Time from Local Optima on Jump Functions
arXiv:2607.14278v1 Announce Type: new Abstract: The paper develops the approach to the runtime analysis of evolutionary algorithms on the basis of limit theorems from probability theory. We consider the family of Jump$_k$ benchmark functions, defined on the search space of binary strings of length $n$, parametrized by