1 citations · 2 across the 4 of their papers we have counts for
Showing cs.NEShow all
2 papers · 1 filter
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…
cs.NE2010★ 1 cited
Computational Complexity Analysis of Simple Genetic Programming On Two Problems Modeling Isolated Program Semantics
Greg Durrett, Frank Neumann, Una-May O'Reilly
Analyzing the computational complexity of evolutionary algorithms for binary search spaces has significantly increased their theoretical understanding. With this paper, we start th…