Adelaide Research & Scholarship: Search

Search

Results 1-10 of 18 (Search time: 0.01 seconds).

previous
1
2
next

Item hits:

Preview	Issue Date	Title	Author(s)
	2007	Comparing Variants of MMAS ACO Algorithms on Pseudo-Boolean Functions	Neumann, F.; Sudholt, D.; Witt, C.; Stutzle, T.; Birattari, M.; Hoos, H.H.; International Workshop on Engineering Stochastic Local Search Algorithms (2007 : Brussels, Belgium)
	2011	Simple max-min ant systems and the optimization of linear pseudo-boolean functions	Kötzing, T.; Neumann, F.; Sudholt, D.; Wagner, M.; ACM SIGEVO Workshop on Foundations of Genetic Algorithms (5 Jan 2011 - 9 Jan 2011 : Schwarzenberg, Austria)
	2008	Rigorous analyses for the combination of ant colony optimization and local search	Neumann, F.; Sudholt, D.; Witt, C.; Dorigo, M.; Birattari, M.; Blum, C.; Clerc, M.; Stutzle, T.; Winfield, A.F.T.; International Conference on Ant Colony Optimization and Swarm Intelligence (6th : 2008 : Brussels, Belgium)
	2017	Analysis of the (1+1) EA on subclasses of linear functions under uniform and linear constraints	Friedrich, 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)
	2014	A fixed budget analysis of randomized search heuristics for the traveling salesperson problem	Nallaperuma, S.; Neumann, F.; Sudholt, D.; Igel, C.; 2014 Annual Conference on Genetic and Evolutionary Computation (GECCO'14) (12 Jul 2014 - 16 Jul 2014 : Vancouver, Canada)
	2020	More effective randomized search heuristics for graph coloring through dynamic optimization	Bossek, J.; Neumann, F.; Peng, P.; Sudholt, D.; 2020 Genetic and Evolutionary Computation Conference (8 Jul 2020 - 12 Jul 2020 : Cancún, Mexico)
	2022	The compact genetic algorithm struggles on Cliff functions	Neumann, F.; Sudholt, D.; Witt, C.; Fieldsend, J.E.; Genetic and Evolutionary Computation Conference (GECCO) (9 Jul 2022 - 13 Jul 2022 : virtual online)
	2021	Time complexity analysis of randomized search heuristics for the dynamic graph coloring problem	Bossek, J.; Neumann, F.; Peng, P.; Sudholt, D.
	2019	Runtime analysis of randomized search heuristics for dynamic graph coloring	Bossek, J.; Neumann, F.; Peng, P.; Sudholt, D.; LopezIbanez, M.; Genetic and Evolutionary Computation Conference (GECCO) (13 Jul 2019 - 17 Jul 2019 : Prague, Czech Republic)
	2017	Speeding up evolutionary multi-objective optimisation through diversity-based parent selection	Osuna, E.; Neumann, F.; Gao, W.; Sudholt, D.; Bosman, P.A.N.; Genetic and Evolutionary Computation Conference (GECCO) (15 Jul 2017 - 19 Jul 2017 : Berlin, Germany)