Adelaide Research & Scholarship: Search

Search

Results 221-230 of 240 (Search time: 0.002 seconds).

previous
1
...
20
21
22
23
24
next

Item hits:

Preview	Issue Date	Title	Author(s)
	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)
	2010	Theoretical properties of two ACO approaches for the traveling salesman problem	Kotzing, 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)
	2007	Rigorous Analyses of Simple Diversity Mechanisms	Friedrich, T.; Hebbinghaus, N.; Neumann, F.; Lipson, H.; Genetic and Evolutionary Computation Conference (9th : 2007 : London, England)
	2008	Approximating Minimum Multicuts by Evolutionary Multi-objective Algorithms	Neumann, F.; Reichel, J.; Rudolph, G.; Jansen, T.; Lucas, S.; Poloni, C.; Beume, N.; Conference on Parallel Problem Solving from Nature (10th : 2008 : Dortmund, Germany)
	2005	RELVIEW - An OBDD-Based Computer Algebra System for Relations	Berghammer, R.; Neumann, F.; Ganzha, V.G.; Mayr, E.W.; Vorozhtsov, E.V.; Computer Algebra in Scientific Computing (8th : 2005 : Kalamata, Greece)
	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)
	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)
	2006	A Relation-Algebraic View on Evolutionary Algorithms for Some Graph Problems	Kehden, B.; Neumann, F.; Gottlieb, J.; Raidl, G.R.; Evolutionary Computation in Combinatorial Optimization (6th : 2006 : Budapest, Hungary)
	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)