Adelaide Research & Scholarship: Search

Search

Results 11-20 of 42 (Search time: 0.002 seconds).

previous
1
2
3
4
5
next

Item hits:

Preview	Issue Date	Title	Author(s)
	2007	Expected runtimes of a simple evolutionary algorithm for the multi-objective minimum spanning tree problem	Neumann, F.
	2009	On the effects of adding objectives to plateau functions	Brockhoff, D.; Friedrich, T.; Hebbinghaus, N.; Klein, C.; Neumann, F.; Zitzler, E.
	2007	Randomized local search, evolutionary algorithms, and the minimum spanning tree problem	Neumann, F.; Wegener, I.
	2009	Comparison of simple diversity mechanisms on plateau functions	Friedrich, T.; Hebbinghaus, N.; Neumann, F.
	2007	Speeding Up Evolutionary Algorithms through Asymmetric Mutation Operators	Doerr, B.; Hebbinghaus, N.; Neumann, F.
	2009	Analyses of simple hybrid algorithms for the vertex cover problem	Friedrich, T.; He, J.; Hebbinghaus, N.; Neumann, F.; Witt, C.
	2006	Speeding up evolutionary algorithms through restricted mutation operators	Doerr, B.; Hebbinghaus, N.; Neumann, F.; Runarsson, T.P.; Beyer, H.G.; Burke, E.; MereloGuervos, J.J.; Whitley, L.D.; Yao, X.; International Conference on Parallel Problem Solving from Nature (9th : 2006 : Reykjavik, Iceland)
	2009	Particle swarm optimization with velocity adaptation	Helwig, S.; Neumann, F.; Wanka, R.; Bouchachia, A.; Nedjah, N.; Mourelle, L.D.; Pedrycz, W.; International Conference on Adaptive and Intelligent Systems (2009 : Klagenfurt, Austria)
	2006	Speeding up approximation algorithms for NP-hard spanning forest problems by multi-objective optimization	Neumann, F.; Laummans, M.; Correa, J.R.; Hevia, A.; Kiwi, M.; International Symposium on Latin American Theoretical Informatics (7th : 2006 : Valdivia, Chile)
	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)