Adelaide Research & Scholarship: Search

Search

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

previous
1
2
next

Item hits:

Preview	Issue Date	Title	Author(s)
	2020	Parameterized complexity analysis of randomized search heuristics	Neumann, F.; Sutton, A.M.; Doerr, B.; Neumann, F.
	2010	Optimal fixed and adaptive mutation rates for the leadingones problem	Bottcher, S.; Doerr, B.; Neumann, F.; Schaefer, R.; Cotta, C.; Kolodziej, J.; Rudolph, G.; International Conference on Parallel Problem Solving from Nature (11th : 2010 : Krakow, Poland)
	2020	Analysis of evolutionary algorithms in dynamic and stochastic environments	Neumann, F.; Pourhassan, M.; Roostapour, V.; Doerr, B.; Neumann, F.
	2020	Optimization of chance-constrained submodular functions	Doerr, B.; Doerr, C.; Neumann, A.; Neumann, F.; Sutton, A.M.; Thirty-Fourth AAAI Conference on Artificial Intelligence (AAAI) (7 Feb 2020 - 12 Feb 2020 : New York, NY, USA)
	2019	Fast re-optimization via structural diversity	Doerr, B.; Doerr, C.; Neumann, F.; LopezIbanez, M.; Genetic and Evolutionary Computation Conference (GECCO) (13 Jul 2019 - 17 Jul 2019 : Prague, Czech Republic)
	2016	Runtime analysis of evolutionary diversity maximization for OneMinMax	Doerr, B.; Gao, W.; Neumann, F.; Friedrich, T.; Neumann, F.; Sutton, A.M.; 2016 Genetic and Evolutionary Computation Conference (GECCO 2016) (20 Jul 2016 - 24 Jul 2016 : Denver, Colorado, USA)
	2015	Improved runtime bounds for the (1+1) EA on random 3-CNF formulas based on fitness-distance correlation	Doerr, B.; Neumann, F.; Sutton, A.; Silva, S.; 2015 Genetic and Evolutionary Computation Conference (GECCO 2015) (11 Jul 2015 - 15 Jul 2015 : Madrid, Spain)
	2011	Evolutionary algorithms and dynamic programming	Doerr, B.; Eremeev, A.; Neumann, F.; Theile, M.; Thyssen, C.
	2013	More effective crossover operators for the all-pairs shortest path problem	Doerr, B.; Johannsen, D.; Kotzing, T.; Neumann, F.; Theile, M.
	2011	Runtime analysis of the 1-ANT ant colony optimizer	Doerr, B.; Neumann, F.; Sudholt, D.; Witt, C.