Modules

16 results

Cross-Cutting Elective Modules16

Convex OptimizationNo ratings for this module yet.AlgorithmsYou learn the fundamentals and methods of convex optimization: analysis of convex sets and functions, optimality conditions, duality, and algorithms such as Simplex, gradient/Newton methods, and interior-point methods. In the end you will be able to formulate problems as convex optimization tasks, derive optimality and duality conditions, and apply appropriate solution methods.6 ECTSruns this semesterEI74351Efficient Algorithms and Data StructuresNo ratings for this module yet.AlgorithmsYou will learn the fundamentals of analyzing algorithms as well as central data structures and fundamental algorithmic problems. The focus is on runtime and space analysis, various search trees, hashing methods, priority queues, union-find structures, as well as maxflow/mincut and matching algorithms. In the end you will be able to analyze algorithms, assess the efficiency of data structures, and design new solutions for problems.8 ECTSruns this semesterIN2003Höhere AlgorithmikNo ratings for this module yet.AlgorithmsYou will learn fundamental techniques for the development and analysis of efficient algorithms (e.g., Divide-and-Conquer, dynamic programming, randomization, Greedy methods, amortized analysis) and apply them to central problems such as sorting, graph problems, string and sequence algorithms, as well as data structures. In the end you will be able to understand, analyze, and use classical algorithmic procedures to solve fundamental tasks.8 ECTSruns this semesterCIT323004Optimierung und ModellanalyseNo ratings for this module yet.AlgorithmsIn this module you will learn fundamental concepts and methods of optimization, model analysis and numerical solution techniques. In the end you will be able to translate technical questions into mathematical optimization tasks and select appropriate solution approaches as well as assess the advantages and disadvantages of the procedures.5 ECTSruns this semesterMW2249Time-Varying Systems and ComputationsNo ratings for this module yet.AlgorithmsYou learn methods for describing and numerically treating time-varying systems as well as efficient algorithms for large-scale and structured problems in numerical linear algebra. In the end you can develop suitable Matlab programs that implement these algorithms for engineering applications and assess their efficiency.6 ECTSruns this semesterEI5052
11 more in Cross-Cutting Elective ModulesAlgorithmic Game TheoryNo ratings for this module yet.AlgorithmsYou will learn the fundamentals of algorithmic game theory at the intersection of computer science, mathematics, and economics. In this module you will deal with algorithmic aspects of game-theoretic solution concepts such as Nash equilibria and with the design of economic mechanisms; in the end you will be able to analyze these concepts algorithmically and in terms of complexity theory.5 ECTSno date this semesterIN2239Auction Theory and Market DesignNo ratings for this module yet.AlgorithmsYou learn game-theoretic fundamentals and mechanism design as well as the theory and practical realization of various auction and matching formats. In the end you will be able to explain properties and payment rules of open and closed auctions, model strategic interactions, and justify the selection of auction formats with regard to efficiency or revenue goals.5 ECTSno date this semesterIN2211Complexity TheoryNo ratings for this module yet.AlgorithmsYou learn formal computational models (in particular Turing machines and circuits) as well as the most important complexity classes (e.g. L, NL, P, NP, PSPACE, EXP, NEXP, PH). By the end you will be able to analyze problems with respect to time and space complexity, apply reductions and completeness proofs, and classify advanced concepts such as alternation, randomized methods, and interactive proof systems.8 ECTSno date this semesterIN2007Computational Social ChoiceNo ratings for this module yet.AlgorithmsYou will become familiar with methods of collective decision making (Social Choice), with a focus on procedures that use majority relations and their algorithmic properties. In the end you will be able to analyze, compare, and assess the computational complexity of various election procedures.6 ECTSno date this semesterIN2229Effiziente Algorithmen und Datenstrukturen IINo ratings for this module yet.AlgorithmsYou will learn advanced algorithmic methods focusing on linear optimization and techniques for solving combinatorial problems. In the end you will be able to formulate linear models, apply classical solution methods such as the Simplex method and advanced methods like Ellipsoid and Karmarkar methods, and use approximation and rounding approaches for NP-complete problems.8 ECTSno date this semesterIN2004Fortgeschrittene Netzwerk- und Graph-AlgorithmenNo ratings for this module yet.AlgorithmsYou deepen knowledge of graph and network algorithms: the focus is on centrality measures, density measurement algorithms in (sub)graphs, connectivity problems, and the assignment problem (Hungarian method). At the end you can analyze complex network problems, assess their complexity, and develop or apply suitable efficient algorithms.8 ECTSno date this semesterIN2158Fundamentals of Optimization for Machine LearningNo ratings for this module yet.AlgorithmsYou will learn fundamentals and advanced techniques of optimization, both convex and nonconvex as well as combinatorial and continuous, with a focus on applications in machine learning. In the end you will be able to understand optimization problems from ML research and approach research questions in this area.5 ECTSno date this semesterCIT413031Online- und ApproximationsalgorithmenNo ratings for this module yet.AlgorithmsYou will learn fundamentals and advanced techniques of online and approximation algorithms. In the end you will know classical online problems (e.g., scheduling, paging, k-server), analysis tools such as amortized analysis and randomized algorithms, as well as design techniques for approximation algorithms including LP-relaxation and randomized rounding.8 ECTSno date this semesterIN2304Parallele AlgorithmenNo ratings for this module yet.AlgorithmsYou deal with models of parallel computation and develop fundamental parallel algorithms. In the end you know various machine models, master basic knowledge of parallel complexity theory, and can design and evaluate parallel algorithms.8 ECTSno date this semesterIN2011Randomisierte AlgorithmenNo ratings for this module yet.AlgorithmsYou learn fundamentals and techniques of randomized algorithms and how to estimate their running time and correctness with probabilistic methods. In the end you will be able to understand and analyze classical randomized algorithms (e.g., randomized Quicksort, Min-Cut, Treaps) and apply tools such as Markov, Chebyshev and Chernoff inequalities.8 ECTSno date this semesterIN2160Topics in Computational Social ChoiceNo ratings for this module yet.AlgorithmsYou study models and methods of collective decision making from social choice theory, in particular those that find application in computer science. Key topics are probabilistic social choice, fair division, and the allocation of public goods; the contents are treated mathematically precisely and with a focus on proofs. In the end you will be able to apply such models, axiomatically analyze properties of aggregation procedures, and work on relevant algorithms and complexity questions.5 ECTSno date this semesterCIT423011
3 more modules match, but they are taught in German. Show themAnerkanntes Wahlmodul im Bereich AlgorithmenNo ratings for this module yet.Algorithmsno date this semesterIN99540Anerkanntes Wahlmodul im Bereich AlgorithmenNo ratings for this module yet.Algorithmsno date this semesterIN99541Ausgewählte Themen aus dem Bereich AlgorithmenNo ratings for this module yet.Algorithms5 ECTSno date this semesterIN3410