Your search returned the following 67 documents:

67. More effective crossover operators for the all-pairs shortest path problem
    Benjamin Doerr, Daniel Johannsen, Timo Kötzing, Frank Neumann, and Madeleine Theile
    Theoretical Computer Science 471: 12-26, 2013
    
66. The max problem revisited: the importance of mutation in genetic programming
    Timo Kötzing, Andrew M. Sutton, Frank Neumann, and Una-May O'Reilly
    In: GECCO’12 : Proceedings of the Fourteenth International Conference on Genetic and Evolutionary Computation, Philadelphia, USA, 2012, 1333-1340
    
65. 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
    
64. Weighted preferences in evolutionary multi-objective optimization
    Tobias Friedrich, Trent Kroeger, and Frank Neumann
    International Journal of Machine Learning and Cybernetics Online First: 1-10, 2012
    
63. Approximation-guided evolutionary multi-objective optimization
    Karl Bringmann, Tobias Friedrich, Frank Neumann, and Markus Wagner
    In: Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence (IJCAI 2011), Barcelona, Spain, 2011, 1198-1203
    
62. Computational complexity analysis of simple genetic programming on two problems modeling isolated program semantics
    Greg Durrett, Frank Neumann, and Una-May O'Reilly
    In: FOGA'11 : Proceedings of the 2011 ACM/SIGEVO Foundations of Genetic Algorithms XI, Schwarzenberg, Austria, 2011, 69-80
    
61. Computing Minimum Cuts by Randomized Search Heuristics
    Frank Neumann, Joachim Reichel, and Martin Skutella
    Algorithmica 59 (3): 323-342, 2011
    
60. Evolutionary algorithms and dynamic programming
    Benjamin Doerr, Anton Eremeev, Frank Neumann, Madeleine Theile, and Christian Thyssen
    Theoretical Computer Science 412: 6020-6035, 2011
    
59. Illustration of fairness in evolutionary multi-objective optimization
    Tobias Friedrich, Christian Horoba, and Frank Neumann
    Theoretical Computer Science 412 (17): 1546-1556, 2011
    
58. Optimising Spatial and Tonal Data for Homogeneous Diffusion Inpainting
    Markus Mainberger, Sebastian Hoffmann, Joachim Weickert, Ching Hoo Tang, Daniel Johannsen, Frank Neumann, and Benjamin Doerr
    In: Scale Space and Variational Methods in Computer Vision : Third International Conference, SSVM 2011, Ein-Gedi, Israel, 2011, 26-37
    
57. Optimizing the Layout of 1000 Wind Turbines
    Markus Wagner, Kalyan Veeramachaneni, Frank Neumann, and Una-May O'Reilly
    In: European Wind Energy Association Annual Event, Brussels, Belgium, 2011, 1-10
    [PDF: Download: 2011ewea.pdf]
    
56. 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
    
55. Simple max-min ant systems and the optimization of linear pseudo-Boolean functions
    Timo Kötzing, Frank Neumann, Dirk Sudholt, and Markus Wagner
    In: FOGA'11 : Proceedings of the 2011 ACM/SIGEVO Foundations of Genetic Algorithms XI, Schwarzenberg, Austria, 2011, 209-218
    
54. PAC learning and genetic programming
    Timo Kötzing, Frank Neumann, and Reto Spöhel
    In: GECCO 2011 : Genetic and Evolutionary Computation Conference, Dublin, Ireland, 2011, 2091-2096
    
53. Ant Colony Optimization and the minimum spanning tree problem
    Frank Neumann and Carsten Witt
    Theoretical Computer Science 411 (25): 2406-2413, 2010
    
52. Ant Colony Optimization and the Minimum Cut Problem
    Timo Kötzing, Per Kristian Lehre, Frank Neumann, and Pietro S. Oliveto
    In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), Portland, USA, 2010, 1393-1400
    
51. 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
    
50. Bioinspired Computation in Combinatorial Optimization : Algorithms and Their Computational Complexity
    Frank Neumann and Carsten Witt
    , Springer, New York, 2010, 216 p.
    
49. Editorial
    Benjamin Doerr, Frank Neumann, and Ingo Wegener
    Algorithmica 57 (1): 119-120, 2010
    
48. Editorial for the Special Issue on Theoretical Aspects of Evolutionary Multi-Objective Optimization
    Thomas Jansen and Frank Neumann
    Evolutionary Computation 18 (3): 333-334, 2010
    
47. Fixed Parameter Evolutionary Algorithms and Maximum Leaf Spanning Trees: A Matter of Mutation
    Stefan Kratsch, Per Kristian Lehre, Frank Neumann, and Pietro Simone Oliveto
    In: Parallel Problem Solving from Nature - PPSN XI. - Pt. 1, Kraków, Poland, 2010, 204-213
    
46. In Memoriam: Ingo Wegener
    Benjamin Doerr and Frank Neumann
    Algorithmica 58 (3): 541-542, 2010
    
45. More Effective Crossover Operators for the All-Pairs Shortest Path Problem
    Benjamin Doerr, Daniel Johannsen, Timo Kötzing, Frank Neumann, and Madeleine Theile
    In: Parallel Problem Solving from Nature - PPSN XI. - Pt. 1, Krakow, Poland, 2010, 184-193
    
44. Optimal fixed and adaptive mutation rates for the LeadingOnes problem
    Süntje Böttcher, Benjamin Doerr, and Frank Neumann
    In: Parallel Problem Solving from Nature - PPSN XI. - Pt. 1, Krakow, Poland, 2010, 1-10
    
43. Plateaus Can Be Harder in Multi-Objective Optimization
    Tobias Friedrich, Nils Hebbinhaus, and Frank Neumann
    Theoretical Computer Science 411 (6): 854-864, 2010
    
42. Set-based Multi-Objective Optimization, Indicators, and Deteriorative Cycles
    Rudolf Berghammer, Tobias Friedrich, and Frank Neumann
    In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), Portland, USA, 2010, 495-502
    
41. 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
    
40. When to Use Bit-Wise Neutrality
    Tobias Friedrich and Frank Neumann
    Natural Computing 9 (1): 283 - 294, 2010. Note: To appear
    
39. Additive Approximations of Pareto-Optimal Sets by Evolutionary Multi-Objective Algorithms
    Chrisitian Horoba and Frank Neumann
    In: FOGA'09 : Revised Selected Papers from ACM SIGEVO Foundations of Genetic Algorithms X, Orlando, USA, 2009, 79-86
    
38. 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
    
37. 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
    
36. Comparison of Simple Diversity Mechanisms on Plateau Functions
    Tobias Friedrich, Nils Hebbinghaus, and Frank Neumann
    Theoretical Computer Science 410 (26): 2455-2462, 2009
    
35. 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
    
34. Computing Single Source Shortest Paths using Single-Objective Fitness Functions
    Surender Baswana, Somenath Biswas, Benjamin Doerr, Tobias Friedrich, Piyush P. Kurur, and Frank Neumann
    In: FOGA'09 : revised selected papers from ACM SIGEVO Foundations of Genetic Algorithms X, Orlando, USA, 2009, 59-66
    
33. Evolutionary Algorithms and Dynamic Programming
    Benjamin Doerr, Anton Eremeev, Christian Horoba, Frank Neumann, and Madeleine Theile
    In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (GECCO 2009), Montreal, Canada, 2009, 771-777
    
32. Fixed-Parameter Evolutionary Algorithms and the Vertex Cover Problem
    Stefan Kratsch and Frank Neumann
    In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (GECCO 2009), Montreal, Canada, 2009, 293-300. Note: Best Paper Award in the track "Combinatorial Optimization and Metaheuristics"
    
31. Multiplicative Approximations and the Hypervolume Indicator
    Tobias Friedrich, Christian Horoba, and Frank Neumann
    In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (GECCO 2009), Montreal, Canada, 2009, 571-578. Note: Best Paper Award in the track "Evolutionary Multiobjective Optimization"
    
30. On the Effects of Adding Objectives to Plateau Functions
    Dimo Brockhoff, Tobias Friedrich, Nils Hebbinghaus, Christian Klein, Frank Neumann, and Eckart Zitzler
    IEEE Transactions on Evolutionary Computation 13 (3): 591-603, 2009
    
29. Particle Swarm Optimization with Velocity Adaptation
    Sabine Helwig, Frank Neumann, and Rolf Wanka
    In: 2009 International Conference on Adaptive and Intelligent Systems ICAIS 2009 : proceedings, Klagenfurt, Austria, 2009, 146-151. Note: Best Paper Award
    
28. Runtime Analysis of a Simple Ant Colony Optimization Algorithm
    Frank Neumann and Carsten Witt
    Algorithmica 54 (2): 243-255, 2009. Note: To appear
    
27. 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
    
26. Theoretical Analysis of Rank-Based Mutation - Combining Exploration and Exploitation
    Pietro Simone Oliveto, Per Kristian Lehre, and Frank Neumann
    In: 2009 IEEE Congress on Evolutionary Computation : CEC, Trondheim, Norway, 2009, 1455-1462
    
25. Analyzing Hypervolume Indicator Based Algorithms
    Dimo Brockhoff, Tobias Friedrich, and Frank Neumann
    In: Parallel Problem Solving from Nature (PPSN X), Dortmund, Germany, 2008, 651-660
    
24. 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
    
23. Approximating Minimum Multicuts by Evolutionary Multi-Objective Algorithms
    Frank Neumann and Joachim Reichel
    In: Parallel Problem Solving from Nature (PPSN X), Dortmund, Germany, 2008, 72-81. Note: Best Paper Award
    
22. Benefits and Drawbacks for the Use of epsilon-Dominance in Evolutionary Multi-Objective Optimization
    Christian Horoba and Frank Neumann
    In: Genetic and Evolutionary Computation Conference 2008, Atlanta, USA, 2008, 641-680
    
21. Computing Minimum Cuts by Randomized Search Heuristics
    Frank Neumann, Joachim Reichel, and Martin Skutella
    In: Genetic and Evolutionary Computation Conference 2008, Atlanta, USA, 2008, 779-786
    
20. Expected Runtimes of Evolutionary Algorithms for the Eulerian Cycle Problem
    Frank Neumann
    Computers and Operations Research 35 (9): 2750-2759, 2008
    
19. Learning Fuzzy Rules with Evolutionary Algorithms - An Analytic Approach
    Jense Kroeske, Adam Ghandar, Zbigniew Michalewicz, and Frank Neumann
    In: Parallel Problem Solving from Nature (PPSN X), Dortmund, Germany, 2008, 1051-1060
    
18. Multi-objective Problems in Terms of Relational Algebra
    Florian Diedrich, Britta Kehden, and Frank Neumann
    In: Relations and Kleene Algebra in Computer Science 2008, Frauenwörth, Germany, 2008, 84-98
    
17. 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
    
16. Rigorous Analyses of Fitness-Proportional Selection for Optimizing Linear Functions
    Edda Happ, Daniel Johannsen, Christian Klein, and Frank Neumann
    In: Genetic and Evolutionary Computation Conference 2008, Atlanta, USA, 2008, 953-960
    [PDF: Download: HappJohannsenKleinNeumann_2008_RigorousAnalysesOfFitness-ProportionalSelectionForOptimizingLinearFunctions.pdf]
    
15. Runtime Analyses for Using Fairness in Evolutionary Multi-Objective Optimization
    Tobias Friedrich, Christian Horoba, and Frank Neumann
    In: Parallel Problem Solving from Nature (PPSN X), Dortmund, Germany, 2008, 671-680
    
14. Using Fast Matrix Multiplication in Bio-Inspired Computation for Complex Optimization Problems
    Florian Diedrich and Frank Neumann
    In: IEEE Congress on Evolutionary Computation 2008, Hong Kong, 2008, 3828-3833
    
13. When to Use Bit-wise Neutrality
    Tobias Friedrich and Frank Neumann
    In: IEEE Congress on Evolutionary Computation 2008, Hong Kong, 2008, 997-1003
    
12. A Rigorous View On Neutrality
    Benjamin Doerr, Michael Gnewuch, Nils Hebbinghaus, and Frank Neumann
    In: IEEE Congress on Evolutionary Computation 2007, Singapore, 2007, 2591-2597
    
11. 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
    
10. 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
    
    
9. Do Additional Objectives Make a Problem Harder?
   Dimo Brockhoff, Tobias Friedrich, Nils Hebbinghaus, Christian Klein, Frank Neumann, and Eckart Zitzler
   In: Genetic and Evolutionary Computation Conference 2007, London, UK, 2007, 765-772
   
8. 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
   
7. 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
   
6. Plateaus Can Be Harder in Multi-Objective Optimization
   Tobias Friedrich, Nils Hebbinghaus, and Frank Neumann
   In: IEEE Congress on Evolutionary Computation 2007, Singapore, Singapore, 2007, 2622-2629
   
5. Randomized Local Search, Evolutionary Algorithms, and the Minimum Spanning Tree Problem
   Frank Neumann and Ingo Wegener
   Theoretical Computer Science 378 (1): 32-40, 2007
   
4. Rigorous Analyses of Simple Diversity Mechanisms
   Tobias Friedrich, Nils Hebbinghaus, and Frank Neumann
   In: Genetic and Evolutionary Computation Conference 2007, London, UK, 2007, 1219-1225. Note: nominated for best paper award
   
3. Speeding up Evolutionary Algorithms Through Asymmetric Mutation Operators
   Benjamin Doerr, Nils Hebbinghaus, and Frank Neumann
   Evolutionary Computation 15 (4): 401-410, 2007
   
2. 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
   
1. Speeding Up Evolutionary Algorithms Through Restricted Mutation Operators
   Benjamin Doerr, Nils Hebbinghaus, and Frank Neumann
   In: Parallel Problem Solving from Nature - PPSN IX, 9th International Conference, Reykjavik, Iceland, 2006, 978-987