4 citations · 4 across the 2 of their papers we have counts for
2 papers
cs.NE2012★ 4 cited
General Upper Bounds on the Running Time of Parallel Evolutionary Algorithms
Jörg Lässig, Dirk Sudholt
We present a new method for analyzing the running time of parallel evolutionary algorithms with spatially structured populations. Based on the fitness-level method, it yields upper…
cs.NE2010
Simple Max-Min Ant Systems and the Optimization of Linear Pseudo-Boolean Functions
Timo Kötzing, Frank Neumann, Dirk Sudholt +1
With this paper, we contribute to the understanding of ant colony optimization (ACO) algorithms by formally analyzing their runtime behavior. We study simple MAX-MIN ant systems on…