Search


Current filters:


Start a new search
Add filters:

Use filters to refine the search results.


Results 1-9 of 9 (Search time: 0.01 seconds).
  • previous
  • 1
  • next
Item hits:
PreviewIssue DateTitleAuthor(s)
2015On the runtime of randomized local search and simple evolutionary algorithms for dynamic makespan schedulingNeumann, F.; Witt, C.; Yang, Q.; Wooldridge, M.; 24th International Joint Conference on Artificial Intelligence (IJCAI 2015) (25 Jul 2015 - 31 Jul 2015 : Buenos Aires, Argentina)
2017Analysis of the (1+1) EA on subclasses of linear functions under uniform and linear constraintsFriedrich, T.; Kötzing, T.; Lagodzinski, G.; Neumann, F.; Schirneck, M.; Igel, C.; Sudholt, D.; Witt, C.; ACM/SIGEVO Conference on Foundations of Genetic Algorithms (FOGA) (12 Jan 2017 - 15 Jan 2017 : Copenhagen, Denmark)
2012Bioinspired computation in combinatorial optimization: algorithms and their computational complexityNeumann, F.; Witt, C.; Soule, T.; 14th International Conference on Genetic and Evolutionary Computation (GECCO'12) (7 Jul 2012 - 11 Jul 2012 : Philadelphia, U.S.A.)
2012Theoretical analysis of two ACO approaches for the traveling salesman problemKotzing, T.; Neumann, F.; Roglin, H.; Witt, C.
2010Ant Colony Optimization and the minimum spanning tree problemNeumann, F.; Witt, C.
2011Runtime analysis of the 1-ANT ant colony optimizerDoerr, B.; Neumann, F.; Sudholt, D.; Witt, C.
2010Bioinspired computation in combinatorial optimization : algorithms and their computational complexityNeumann, F.; Witt, C.
2010A few ants are enough: ACO with iteration-best updateNeumann, F.; Sudholt, D.; Witt, C.; Pelikan, M.; Branke, J.; Genetic and Evolutionary Computation Conference (12th : 2010 : Portland, Oregon)
2010Theoretical properties of two ACO approaches for the traveling salesman problemKotzing, T.; Neumann, F.; Roglin, H.; Witt, C.; Dorigo, M.; Birattari, M.; Di Carlo, G.; Doursat, R.; Engelbrecht, A.; International Conference on Swarm Intelligence (2010 : Brussels, Belgium)