Search

We found 467 hits for your search of 'ALGORITHM'.
  1. Offers

    /departments/algorithms-complexity/offers

    parallel and external algorithms, distributed algorithms, complexity theory, combinatorial and continuous optimization, graph drawing, on-line algorithms, randomized algorithms, computational biology and [...] Research Departments Algorithms and Complexity Offers Offers The interests of the (around 40) research group members includes data structures, graph and network algorithms, computational geometry, parallel [...] and implementation of algorithms and program libraries. The group consists mainly of young researchers of several nationalities. Our working language is English. The group collaborates with several of the

  2. Theory of Distributed Systems

    /departments/algorithms-complexity/teaching/winter18/tods

    Konzepte der Informatik Multivariate Algorithmics Randomized and Approximation Algorithms Algorithms on Directed Graphs Theory of Distributed Systems Reading Group Algorithms [...] Link Reversal Algorithms " ( Matthias Függer ) n/a 29.01. see below Port Numbering Sheet 12 optional: 05.02. 05.02., Vid Guest lecture " Using Computers to Design Distributed Algorithms " ( Jukka Suomela [...] Research Departments Algorithms and Complexity Teaching Winter 2018/19 Theory of Distributed Systems Theory of Distributed Systems Advanced Course, 2+2 Basic Information Lectures: Tuesday, 10: 10 - 11:

  3. Optimality in Matching Problems

    /news/spotlight-articles/optimization/optimality-in-matching-problems

    first linear-time algorithm for computing the approximate maximum matching in general graphs, which can achieve an arbitrarily small approximation ratio. Ran Duan DEPT. 1 Algorithms and Complexity Phone [...] Chien-Chung Huang DEPT. 1 Algorithms and Complexity Phone +49 681 9325-1016 Email villars@mpi-inf.mpg.de Improving Flat Panel Displays by Discrete Optimization Energy Efficient Algorithms From Routing to Pricing [...] Rule-based Product Confi guration Approximation Algorithms for Profi t-maximizing Pricing Problems Query Complexity: From Theory of Evolutionary Algorithms to Mastermind Optimality in Matching Problems

  4. Computer scientist Danupon Nanongkai appointed Scientific Member of Max Planck Society

    /news/detail?tx_news_pi1%5Baction%5D=detail&tx_news_pi1%5Bcontroller%5D=News&tx_news_pi1%5Bnews%5D=434&cHash=b4491a4c081b89cd1cf950a4dfbaaf75

    frontier of algorithms and complexity theory. Professor Nanongkai and his group are well-known for answering many long-standing fundamental questions in the theory of graph (network) algorithms, with a particular [...] the mathematical foundations of information technology (algorithms and complexity, logic of programming) as well as developing new algorithms for various application areas such as computer graphics, geometry [...] particular emphasis on algorithmic techniques that work across different computational paradigms such as distributed networks, dynamic graphs, and data streams. Their breakthroughs include the first efficient

  5. Computation of Equilibrium Prices

    /news/spotlight-articles/optimization/computation-of-equilibrium-prices

    relatively simple combinatorial algorithm. Ran Duan DEPT. 1 Algorithms and Complexity Phone +49 681 9325-1009 Email duanran@mpi-inf.mpg.de Kurt Mehlhorn DEPT. 1 Algorithms and Complexity Phone +49 681 9325-1000 [...] Energy Efficient Algorithms From Routing to Pricing and Learning: Why Are They Hard to Compute? Computation of Equilibrium Prices Rule-based Product Confi guration Approximation Algorithms for Profi t-maximizing [...] multiple decades before the answer was found for Walras’ model. First in 2007, K. Jain found an algorithm with polynomial runtime, although it was still not satisfactory because of their use of the ellipsoid

  6. How to Keep Your Neighbors Close – in Time

    /news/spotlight-articles/2019/how-to-keep-your-neighbors-close-in-time

    power of the GCS algorithm in practice, our group is working to design hardware implementations of the GCS algorithm. That is, we seek to design physical circuits implementing the algorithm that are robust [...] optimal theoretical algorithm for the basic GCS problem has been known for 10 years, but there are still many open questions related to generalizing and implementing the algorithm. For example, recent [...] recent work showed that the algorithm can be adapted to dynamic networks, where nodes and connections may be added and removed. Recently, our group also showed that the GCS algorithm can be generalized to f

  7. Topics in Algorithmic Game Theory and Economics

    /departments/algorithms-complexity/teaching/winter20/game-theory

    Research Departments Algorithms and Complexity Teaching Winter 2020/21 Topics in Algorithmic Game Theory and Economics Topics in Algorithmic Game Theory and Economics Advanced Course, 2+1 Basic Information [...] prophet inequalities. References (books) Algorithmic Game Theory by Noam Nisan, Tim Roughgarden, Éva Tardos and Vijay V. Vazirani [NRTV2008] Twenty Lectures on Algorithmic Game Theory by Tim Roughgarden [R2016] [...] not be distributed. Algorithms and Data Structures How To Clock Your Computer Ideen und Konzepte der Informatik Property Testing Theory of Distributed Systems Topics in Algorithmic Game Theory and Economics

  8. Labelled Pupils in the Wild (LPW)

    /departments/computer-vision-and-machine-learning/research/gaze-based-human-computer-interaction/labelled-pupils-in-the-wild-lpw

    art pupil detection algorithms. Pupil Labs[1] is the algorithmused in the Pupil Pro eye tracker. Swirski[2] and ExCuSe[3] are taken as examples of the state-of-the-art algorithms. Isophote[4] and Gradient[5] [...] also greatly disturbs the per-formance of the examined algorithms, which is also visible in the figure. One could expect this, since all algorithms either look forlarge black blobs or strong edges, which [...] d to 80x 35pixels. Thus the performance for those algorithms remainsconstant, except for the smallest resolutions. As one can see theother algorithms all start to drop significantly in performance at some

  9. Theory of Distributed Systems

    /departments/algorithms-complexity/teaching/winter15/tods

    required for this course. Algorithms and Data Structures Approximation Algorithms Theory of Distributed Systems Ideen und Konzepte der Informatik Reading Group Algorithms Algorithmic Lower Bound Techniques [...] Research Departments Algorithms and Complexity Teaching Theory of Distributed Systems Theory of Distributed Systems Advanced Course, 2+2 Basic Information Lectures: Monday, 12:15 - 14:00, E1.4 023 Lecturer: [...] memory, synchrony vs. asynchrony, fault-tolerance, and congestion. The focus lies on key concepts, algorithmic ideas, and mathematical analysis. Despite some overlap in topics, the angle is very different from

  10. Optimization

    /departments/algorithms-complexity/teaching/summer19/opt

    polyhedral theory will be introduced. The simplex algorithm and the ellipsoid method will be presented. The lecture concludes with exact and approximation algorithms for NP-hard optimization problems. There will [...] Tsitsiklis. Distributed and Sequential Graph Algorithms Fine-Grained Complexity Theory Introduction to Boolean Function Complexity Reading Group Algorithms Optimization Keeping Time in Distributed Systems [...] Research Departments Algorithms and Complexity Teaching Summer 2019 Optimization Optimization Core Course, 4+2 Basic Information Lecturer: Andreas Karrenbauer Lectures: Tuesday + Thursday, 14:00 - 16:00