Παρακολούθηση
Tobias Friedrich
Tobias Friedrich
Chair for Algorithm Engineering, Hasso Plattner Institute, Potsdam, Germany
Η διεύθυνση ηλεκτρονικού ταχυδρομείου έχει επαληθευτεί στον τομέα hpi.de
Τίτλος
Παρατίθεται από
Παρατίθεται από
Έτος
Why rumors spread so quickly in social networks
B Doer, M Fouz, T Friedrich
Communications of the ACM 55 (6), 70-75, 2012
4802012
Approximating the volume of unions and intersections of high-dimensional geometric objects
K Bringmann, T Friedrich
Computational Geometry 43 (6-7), 601-610, 2010
2022010
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
1762007
Approximating the least hypervolume contributor: NP-hard in general, but fast in practice
K Bringmann, T Friedrich
Theoretical Computer Science 425, 104-116, 2012
1722012
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
1722011
Nonlinear climate sensitivity and its implications for future greenhouse warming
T Friedrich, A Timmermann, M Tigchelaar, O Elison Timm, A Ganopolski
Science Advances 2 (11), e1501923, 2016
1682016
Approximation quality of the hypervolume indicator
K Bringmann, T Friedrich
Artificial Intelligence 195, 265-290, 2013
147*2013
Analyzing hypervolume indicator based algorithms
D Brockhoff, T Friedrich, F Neumann
International Conference on Parallel Problem Solving from Nature, 651-660, 2008
1352008
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
1322017
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
1312007
Analysis of diversity-preserving mechanisms for global exploration
T Friedrich, PS Oliveto, D Sudholt, C Witt
Evolutionary Computation 17 (4), 455-476, 2009
1202009
Quasirandom rumor spreading
B Doerr, T Friedrich, T Sauerwald
ACM Transactions on Algorithms (TALG) 11 (2), 1-35, 2014
119*2014
An efficient algorithm for computing hypervolume contributions
K Bringmann, T Friedrich
Evolutionary Computation 18 (3), 383-402, 2010
1062010
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
1042016
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
1042009
Approximation-guided evolutionary multi-objective optimization
K Bringmann, T Friedrich, F Neumann, M Wagner
IJCAI Proceedings-International Joint Conference on Artificial Intelligence …, 2011
1032011
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
1022013
Efficient embedding of scale-free graphs in the hyperbolic plane
T Bläsius, T Friedrich, A Krohmer, S Laue
IEEE/ACM transactions on Networking 26 (2), 920-933, 2018
822018
Deterministic random walks on the two-dimensional grid
B Doerr, T Friedrich
Combinatorics, Probability and Computing 18 (1-2), 123-144, 2009
802009
Quasirandom rumor spreading: Expanders, push vs. pull, and robustness
B Doerr, T Friedrich, T Sauerwald
Automata, Languages and Programming, 366-377, 2009
80*2009
Δεν είναι δυνατή η εκτέλεση της ενέργειας από το σύστημα αυτή τη στιγμή. Προσπαθήστε ξανά αργότερα.
Άρθρα 1–20