Dirk Sudholt
TitleCited byYear
A new method for lower bounds on the running time of evolutionary algorithms
D Sudholt
IEEE Transactions on Evolutionary Computation 17 (3), 418-435, 2012
872012
Crossover is provably essential for the Ising model on trees
D Sudholt
Proceedings of the 7th annual conference on Genetic and evolutionary …, 2005
862005
Analysis of diversity-preserving mechanisms for global exploration
T Friedrich, PS Oliveto, D Sudholt, C Witt
Evolutionary Computation 17 (4), 455-476, 2009
792009
The impact of parametrization in memetic evolutionary algorithms
D Sudholt
Theoretical Computer Science 410 (26), 2511-2528, 2009
672009
Analysis of different MMAS ACO algorithms on unimodal functions and plateaus
F Neumann, D Sudholt, C Witt
Swarm Intelligence 3 (1), 35-68, 2009
652009
How crossover helps in pseudo-boolean optimization
T Kötzing, D Sudholt, M Theile
Proceedings of the 13th annual conference on Genetic and evolutionary …, 2011
642011
On the runtime analysis of the 1-ANT ACO algorithm
B Doerr, F Neumann, D Sudholt, C Witt
Proceedings of the 9th annual conference on Genetic and evolutionary …, 2007
552007
The choice of the offspring population size in the (1, λ) evolutionary algorithm
JE Rowe, D Sudholt
Theoretical Computer Science 545, 20-38, 2014
522014
Crossover speeds up building-block assembly
D Sudholt
Proceedings of the 14th annual conference on Genetic and evolutionary …, 2012
472012
Parallel evolutionary algorithms
D Sudholt
Springer Handbook of Computational Intelligence, 929-959, 2015
462015
Adaptive population models for offspring populations and parallel evolutionary algorithms
J Lässig, D Sudholt
Proceedings of the 11th workshop proceedings on Foundations of genetic …, 2011
462011
Running time analysis of ant colony optimization for shortest path problems
D Sudholt, C Thyssen
Journal of Discrete Algorithms 10, 165-180, 2012
452012
The choice of the offspring population size in the (1, λ) EA
JE Rowe, D Sudholt
Proceedings of the 14th annual conference on Genetic and evolutionary …, 2012
432012
Mutation rate matters even when optimizing monotonic functions
B Doerr, T Jansen, D Sudholt, C Winzen, C Zarges
Evolutionary computation 21 (1), 1-27, 2013
402013
General lower bounds for the running time of evolutionary algorithms
D Sudholt
International Conference on Parallel Problem Solving from Nature, 124-133, 2010
392010
Rigorous analyses for the combination of ant colony optimization and local search
F Neumann, D Sudholt, C Witt
International Conference on Ant Colony Optimization and Swarm Intelligence …, 2008
392008
Runtime analysis of binary PSO
D Sudholt, C Witt
Proceedings of the 10th annual conference on Genetic and evolutionary …, 2008
392008
Unbiased black-box complexity of parallel search
G Badkobeh, PK Lehre, D Sudholt
International Conference on Parallel Problem Solving from Nature, 892-901, 2014
372014
Design and analysis of migration in parallel evolutionary algorithms
J Lässig, D Sudholt
Soft Computing 17 (7), 1121-1144, 2013
372013
Theoretical analysis of diversity mechanisms for global exploration
T Friedrich, PS Oliveto, D Sudholt, C Witt
Proceedings of the 10th annual conference on Genetic and evolutionary …, 2008
372008
The system can't perform the operation now. Try again later.
Articles 1–20