Search Results for author:
Found 1 papers, 0 papers with code
Lasting Diversity and Superior Runtime Guarantees for the $(μ+1)$ Genetic Algorithm
From this better understanding of the population diversity, we obtain stronger runtime guarantees, among them the statement that for all $c\ln(n)\le\mu \le n/\log n$, with $c$ a suitable constant, the runtime of the $(\mu+1)$ GA on $\mathrm{Jump}_k$, with $k \ge 3$, is $O(n^{k-1})$.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
