Tobias Friedrich
Tobias Friedrich
Chair for Algorithm Engineering, Hasso Plattner Institute, Potsdam, Germany
E-mailová adresa ověřena na:
Why rumors spread so quickly in social networks
B Doer, M Fouz, T Friedrich
Communications of the ACM 55 (6), 70-75, 2012
Approximating the volume of unions and intersections of high-dimensional geometric objects
K Bringmann, T Friedrich
Computational Geometry 43 (6-7), 601-610, 2010
Social networks spread rumors in sublogarithmic time
B Doerr, M Fouz, T Friedrich
Proceedings of the forty-third annual ACM symposium on Theory of computing …, 2011
Approximating the least hypervolume contributor: NP-hard in general, but fast in practice
K Bringmann, T Friedrich
International Conference on Evolutionary Multi-Criterion Optimization, 6-20, 2009
Approximating covering problems by randomized search heuristics using multi-objective models
T Friedrich, N Hebbinghaus, F Neumann, J He, C Witt
Proceedings of the 9th Annual Conference on Genetic and Evolutionary …, 2007
Approximation quality of the hypervolume indicator
K Bringmann, T Friedrich
Artificial Intelligence 195, 265-290, 2013
Quasirandom rumor spreading
B Doerr, T Friedrich, T Sauerwald
ACM Transactions on Algorithms (TALG) 11 (2), 1-35, 2014
Do additional objectives make a problem harder?
D Brockhoff, T Friedrich, N Hebbinghaus, C Klein, F Neumann, E Zitzler
Proceedings of the 9th annual conference on Genetic and evolutionary …, 2007
Analysis of diversity-preserving mechanisms for global exploration
T Friedrich, PS Oliveto, D Sudholt, C Witt
Evolutionary Computation 17 (4), 455-476, 2009
Analyzing hypervolume indicator based algorithms
D Brockhoff, T Friedrich, F Neumann
International Conference on Parallel Problem Solving from Nature, 651-660, 2008
Approximation-guided evolutionary multi-objective optimization
K Bringmann, T Friedrich, F Neumann, M Wagner
Twenty-Second International Joint Conference on Artificial Intelligence, 2011
On the effects of adding objectives to plateau functions
D Brockhoff, T Friedrich, N Hebbinghaus, C Klein, F Neumann, E Zitzler
IEEE Transactions on Evolutionary Computation 13 (3), 591-603, 2009
An efficient algorithm for computing hypervolume contributions
K Bringmann, T Friedrich
Evolutionary Computation 18 (3), 383-402, 2010
Escaping local optima using crossover with emergent diversity
DC Dang, T Friedrich, T Kötzing, MS Krejca, PK Lehre, PS Oliveto, ...
IEEE Transactions on Evolutionary Computation 22 (3), 484-497, 2017
Predicting the energy output of wind farms based on weather data: Important variables and their correlation
E Vladislavleva, T Friedrich, F Neumann, M Wagner
Renewable Energy 50, 236-243, 2013
Mediterranean winter rainfall in phase with African monsoons during the past 1.36 million years
B Wagner, H Vogel, A Francke, T Friedrich, T Donders, JH Lacey, ...
Nature 573 (7773), 256-260, 2019
Measuring biological age via metabonomics: the metabolic age score
J Hertel, N Friedrich, K Wittfeld, M Pietzner, K Budde, S Van der Auwera, ...
Journal of proteome research 15 (2), 400-410, 2016
PROTECT: PRoximal balloon Occlusion TogEther with direCt Thrombus aspiration during stent retriever thrombectomy–evaluation of a double embolic protection approach in …
C Maegerlein, S Mönch, T Boeckh-Behrens, M Lehm, DM Hedderich, ...
Journal of neurointerventional surgery 10 (8), 751-755, 2018
Quasirandom rumor spreading: Expanders, push vs. pull, and robustness
B Doerr, T Friedrich, T Sauerwald
Automata, Languages and Programming, 366-377, 2009
The compact genetic algorithm is efficient under extreme gaussian noise
T Friedrich, T Kötzing, MS Krejca, AM Sutton
IEEE Transactions on Evolutionary Computation 21 (3), 477-490, 2016
Systém momentálně nemůže danou operaci provést. Zkuste to znovu později.
Články 1–20