Francesco Quinzan
Francesco Quinzan
Hasso Plattner Institute, University of Potsdam
Verified email at hpi.de
Title
Cited by
Cited by
Year
Escaping large deceptive basins of attraction with heavy-tailed mutation operators
T Friedrich, F Quinzan, M Wagner
Proceedings of the Genetic and Evolutionary Computation Conference, 293-300, 2018
182018
Heavy-tailed mutation operators in single-objective combinatorial optimization
T Friedrich, A Göbel, F Quinzan, M Wagner
International Conference on Parallel Problem Solving from Nature, 134-145, 2018
162018
Greedy maximization of functions with bounded curvature under partition matroid constraints
T Friedrich, A Göbel, F Neumann, F Quinzan, R Rothenberger
Proceedings of the AAAI Conference on Artificial Intelligence 33, 2272-2279, 2019
102019
Approximating optimization problems using EAs on scale-free networks
A Chauhan, T Friedrich, F Quinzan
Proceedings of the Genetic and Evolutionary Computation Conference, 235-242, 2017
52017
Evolutionary Algorithms and Submodular Functions: Benefits of Heavy-Tailed Mutations
T Friedrich, A Göbel, F Quinzan, M Wagner
arXiv preprint arXiv:1805.10902, 2018
22018
Resampling vs recombination: A statistical run time estimation
T Friedrich, T Kötzing, F Quinzan, AM Sutton
Proceedings of the 14th ACM/SIGEVO Conference on Foundations of Genetic …, 2017
22017
Non-monotone submodular maximization with multiple knapsacks in static and dynamic settings
V Doskoč, T Friedrich, A Göbel, F Neumann, A Neumann, F Quinzan
arXiv preprint arXiv:1911.06791, 2019
2019
Improving the run time of the (1+ 1) evolutionary algorithm with luby sequences
T Friedrich, T Kötzing, F Quinzan, AM Sutton
Proceedings of the Genetic and Evolutionary Computation Conference, 301-308, 2018
2018
The system can't perform the operation now. Try again later.
Articles 1–8