Lower bounds on the runtime of crossover-based algorithms via decoupling and family graphs.

Andrew M. Sutton Carsten Witt

Published in: GECCO (2019)

Keyphrases

lower bound
graph theory
optimization problems
worst case
genetic algorithm ga
neural network
learning algorithm
online algorithms
upper bound
theoretical analysis
running times
memory efficient
average case
input output
evolutionary algorithm
search space
genetic algorithm