168 parallel-computing-numerical-methods-"Simons-Foundation" positions at Technical University of Munich
Sort by
Refine Your Search
-
Listed
-
Category
-
Program
-
Field
-
scientific work on design automation for quantum computers and develop methods and software tools dedicated to the design and realization of quantum algorithms/circuits. One of the main challenges in
-
investigations carried out on the research compressor by an integrated team of LTF and an industry partner. - Numerical modelling compressor stages and carry out simulation of methods to enhance aerodynamic
-
under civil law in Freising, is a research institution of the Leibniz Association that combines methods of biomolecular basic research with analysis methods of bioinformatics and analytical high
-
and evaluation of innovative data- and machine learning-based systems to integrate more renewable energy into our energy systems and make energy use more efficient. We develop new optimization methods
-
failure mechanisms. The performance of the developed methods will be evaluated using real operating data. In addition, it will be investigated how reliability and safety conditions can be taken into account
-
and industry insights. The candidate will be expected to: Apply advanced analytical and AI methods to solve real-world operational challenges. Publish in leading journals and present research
-
(https://soilsystems.net/ ), a Priority Programme (SPP 2322) funded by the Deutsche Forschungsgemeinschaft (DFG; German Research Foundation). Within SoilSystems, scientists from different disciplines from
-
• Conduct statistical consultation for Helmholtz scientists and industry partners • Evaluate and apply novel statistical methods in the context of applied research • Write statistical reports on experimental
-
10.08.2021, Wissenschaftliches Personal Positions in the Formal Methods for Software Reliability group of TU Munich led by Prof. Jan Kretinsky: - postdoc in the area of quantitative verification
-
13.01.2020, Wissenschaftliches Personal PhD position at the Chair of Algorithms and Complexity. Candidate shall work on approximation algorithms for scheduling problems in parallel and distributed