Your search returned the following 23 documents:

23. When Do Evolutionary Algorithms Optimize Separable Functions in Parallel?
    Benjamin Doerr, Dirk Sudholt, and Carsten Witt
    In: ACM/SIGEVO Foundations of Genetic Algorithms (FOGA 2013), Adelaide, Australia, 2013, 51-63
    
22. Theoretical analysis of two ACO approaches for the traveling salesman problem
    Timo Kötzing, Frank Neumann, Heiko Röglin, and Carsten Witt
    Swarm Intelligence 6 (1): 1-21, 2012
    
21. Runtime analysis of the 1-ANT ant colony optimizer
    Benjamin Doerr, Frank Neumann, Dirk Sudholt, and Carsten Witt
    Theoretical Computer Science 412 (17): 1629-1644, 2011
    
20. Sharp bounds by probability-generating functions and variable drift
    Benjamin Doerr, Mahmoud Fouz, and Carsten Witt
    In: GECCO 2011 : Genetic and Evolutionary Computation Conference, Dublin, Ireland, 2011, 2083-2090
    
19. Ant Colony Optimization and the minimum spanning tree problem
    Frank Neumann and Carsten Witt
    Theoretical Computer Science 411 (25): 2406-2413, 2010
    
18. Approximating Covering Problems by Randomized Search Heuristics using Multi-Objective Models
    Tobias Friedrich, Jun He, Nils Hebbinghaus, Frank Neumann, and Carsten Witt
    Evolutionary Computation 18 (4): 617 - 633, 2010
    
17. Bioinspired Computation in Combinatorial Optimization : Algorithms and Their Computational Complexity
    Frank Neumann and Carsten Witt
    , Springer, New York, 2010, 216 p.
    
16. Quasirandom Evolutionary Algorithms
    Benjamin Doerr, Mahmoud Fouz, and Carsten Witt
    In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), Portland, USA, 2010, 1457-1464
    
15. Theoretical Properties of Two ACO Approaches for the Traveling Salesman Problem
    Timo Kötzing, Frank Neumann, Heiko Röglin, and Carsten Witt
    In: Swarm Intelligence : 7th International Conference, ANTS 2010, Brussels, Belgium, 2010, 324-335
    
14. Analyses of Simple Hybrid Algorithms for the Vertex Cover Problem
    Tobias Friedrich, Jun He, Nils Hebbinghaus, Frank Neumann, and Carsten Witt
    Evolutionary Computation, 17 (1): 3-19, 2009
    
13. Analysis of Different MMAS ACO Algorithms on Unimodal Functions and Plateaus
    Frank Neumann, Dirk Sudholt, and Carsten Witt
    Swarm Intelligence 3 (1): 35-68, 2009
    
12. Analysis of Diversity-Preserving Mechanisms for Global Exploration
    Tobias Friedrich, Pietro Oliveto, Dirk Sudholt, and Carsten Witt
    Evolutionary Computation 17 (4): 455-476, 2009
    
11. Computational Complexity of Ant Colony Optimization and Its Hybridization with Local Search
    Frank Neumann, Dirk Sudholt, and Carsten Witt
    In: Innovations in Swarm Intelligence, 2009, 91-120
    
10. Runtime Analysis of a Simple Ant Colony Optimization Algorithm
    Frank Neumann and Carsten Witt
    Algorithmica 54 (2): 243-255, 2009. Note: To appear
    
9. Theoretical Analysis of Fitness-Proportional Selection: Landscapes and Efficiency
   Frank Neumann, Pietro Simone Oliveto, and Carsten Witt
   In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (GECCO 2009), Montreal, Canada, 2009, 835-842
   
8. Ant Colony Optimization and the Minimum Spanning Tree Problem
   Frank Neumann and Carsten Witt
   In: International Conference on Learning and Intelligent Optimization 2007, Trento, Italia, 2008, 153-166
   
7. Rigorous Analyses for the Combination of Ant Colony Optimization and Local Search
   Frank Neumann, Dirk Sudholt, and Carsten Witt
   In: International Conference on Ant Colony Optimization and Swarm Intelligence 2008, Brussels, Belgium, 2008, 132-143
   
6. Theoretical Analysis of Diversity Mechanisms for Global Exploration
   Tobias Friedrich, Pietro Oliveto, Dirk Sudholt, and Carsten Witt
   In: Proceedings of the 10th annual conference on Genetic and evolutionary computation (GECCO 2008), Atlanta, USA, 2008, 945-952
   
5. Ant Colony Optimization and the Minimum Spanning Tree Problem
   Frank Neumann and Carsten Witt
   Electronic Colloquium on Computational Complexity, http://eccc.hpi-web.de/eccc/, TR06-143, Technical Report
   
4. Approximating Covering Problems by Randomized Search Heuristics Using Multi-Objective Models
   Tobias Friedrich, Jun He, Nils Hebbinghaus, Frank Neumann, and Carsten Witt
   In: Genetic and Evolutionary Computation Conference 2007, London, UK, 2007, 797-804
   
3. Comparing Variants of MMAS ACO Algorithms on Pseudo-Boolean Functions
   Frank Neumann, Dirk Sudholt, and Carsten Witt
   In: Engineering Stochastic Local Search Algorithms 2007, Brussels, Belgium, 2007, 61-75
   
   
2. On Improving Approximate Solutions by Evolutionary Algorithms
   Tobias Friedrich, Jun He, Nils Hebbinghaus, Frank Neumann, and Carsten Witt
   In: IEEE Congress on Evolutionary Computation 2007, Singapore, Singapore, 2007, 2614-2621
   
1. On the Runtime Analysis of the 1-ANT ACO algorithm
   Benjamin Doerr, Frank Neumann, Dirk Sudholt, and Carsten Witt
   In: Genetic and Evolutionary Computation Conference 2007, London, UK, 2007, 33-40. Note: Best paper award