General Upper Bounds on the Runtime of Parallel Evolutionary Algorithms.
Jörg LässigDirk SudholtPublished in: Evol. Comput. (2014)
Keyphrases
- evolutionary algorithm
- upper bound
- special case
- evolutionary computation
- lower bound
- multi objective
- efficiently computable
- differential evolution algorithm
- upper and lower bounds
- data sets
- closely related
- lower and upper bounds
- multi objective optimization
- differential evolution
- genetic programming
- simulated annealing
- genetic algorithm
- machine learning
- branch and bound
- parallel programming
- tight bounds
- neural network