Publications

Found 15 results
Author Title Type [ Year(Desc)]
Filters: Author is Dirk Sudholt  [Clear All Filters]
2009
Friedrich, T., Oliveto P.. S., Sudholt D., & Witt C. (2009).  Analysis of Diversity-Preserving Mechanisms for Global Exploration. Evolutionary Computation. 17(4), 455-476.
Horoba, C., & Sudholt D. (2009).  Running Time Analysis of ACO Systems for Shortest Path Problems. 76-91.
2010
Jansen, T., & Sudholt D. (2010).  Analysis of an Asymmetric Mutation Operator. Evolutionary Computation. 18(1), 1-26.
Sudholt, D., & Zarges C. (2010).  Analysis of an Iterated Local Search Algorithm for Vertex Coloring.
Horoba, C., & Sudholt D. (2010).  Ant Colony Optimization for Stochastic Shortest Path Problems. 1465-1472.
Lässig, J., & Sudholt D. (2010).  The Benefit of Migration in Parallel Evolutionary Algorithms. 1105-1112.
Lässig, J., & Sudholt D. (2010).  Experimental Supplements to the Theoretical Analysis of Migration in the Island Model. 224-233.
Neumann, F., Sudholt D., & Witt C. (2010).  A Few Ants Are Enough: ACO with Iteration-Best Update. 63-70.
Sudholt, D. (2010).  General Lower Bounds for the Running Time of Evolutionary Algorithms. 124-133.
Lässig, J., & Sudholt D. (2010).  General Scheme for Analyzing Running Times of Parallel Evolutionary Algorithms. 234-243.
Doerr, B., Jansen T., Sudholt D., Winzen C., & Zarges C. (2010).  Optimizing Monotone Functions Can Be Difficult. 42-51.
Sauerwald, T., & Sudholt D. (2010).  A Self-Stabilizing Algorithm for Cut Problems in Synchronous Networks. Theoretical Computer Science. 411(14-15), 1599-1612.
2011
Lässig, J., & Sudholt D. (2011).  Adaptive Population Models for Offspring Populations and Parallel Evolutionary Algorithms. 181-192.
Koetzing, T.., Neumann F., Sudholt D., & Wagner M.. (2011).  Simple Max-Min Ant Systems and the Optimization of Linear Pseudo-Boolean Functions. 209-218.
Sudholt, D. (2011).  Using Markov-Chain Mixing Time Estimates for the Analysis of Ant Colony Optimization. 139-150.