Adelaide Research & Scholarship: Search

Search

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

previous
1
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)
	2007	Expected runtimes of a simple evolutionary algorithm for the multi-objective minimum spanning tree problem	Neumann, F.
	2007	Randomized local search, evolutionary algorithms, and the minimum spanning tree problem	Neumann, F.; Wegener, I.
	2007	Speeding Up Evolutionary Algorithms through Asymmetric Mutation Operators	Doerr, B.; Hebbinghaus, N.; Neumann, F.
	2007	Approximating covering problems by randomized search heuristics using multi-objective models	Friedrich, T.; He, J.; Hebbinghaus, N.; Neumann, F.; Witt, C.; Genetic and Evolutionary Computation Conference (9th : 2007 : London, England)
	2007	On the Runtime Analysis of the 1-ANT ACO Algorithm	Doerr, B.; Neumann, F.; Sudholt, D.; Witt, C.; Lipson, H.; Genetic and Evolutionary Computation Conference (9th : 2007 : London, England)
	2007	Do additional objectives make a problem harder?	Brockhoff, D.; Friedrich, T.; Hebbinghaus, N.; Klein, C.; Neumann, F.; Zitzler, E.; Lipson, H.; Genetic and Evolutionary Computation Conference (9th : 2007 : London, England)
	2007	Rigorous Analyses of Simple Diversity Mechanisms	Friedrich, T.; Hebbinghaus, N.; Neumann, F.; Lipson, H.; Genetic and Evolutionary Computation Conference (9th : 2007 : London, England)
	2007	On improving approximate solutions by evolutionary algorithms	Friedrich, T.; He, J.; Hebbinghaus, N.; Neumann, F.; Witt, C.; IEEE Congress on Evolutionary Computation (2007 : Singapore)
	2007	A Rigorous View On Neutrality	Doerr, B.; Gnewuch, M.; Hebbinghaus, N.; Neumann, F.; IEEE Congress on Evolutionary Computation (2007 : Singapore)