Sort by
Refine Your Search
- 
                Listed
 - 
                Category
 - 
                Field
 
- 
                
                
                
programming experience; apply by sending CV and transcripts to alanwar@tum.de About the Role: Join us to push the state of the art in formal verification and reachability analysis for discrete-space systems
 - 
                
                
                
of representation theory, structure theory of Kac-Moody algebras, geometric/combinatorial representation theory, quiver representation theory. • Some experience with SageMath, polymake or other related mathematical
 - 
                
                
                
representation theory. • Some experience with SageMath, polymake or other related mathematical software. • Proficiency in English, both written and spoken. Knowledge of German is not required. In addition
 - 
                
                
                
Learning Formal Methods Dynamical Systems Control Theory Context The applicant will be directly advised by Prof. Matthias Althoff (https://www.ce.cit.tum.de/cps/members/prof-dr-ing-matthias-althoff
 - 
                
                
                
technologies to fundamental physics questions. The advertised positions will be part of the project “QS-Gauge: quantum simulation of lattice gauge theories”, funded by the Emmy Noether programme of the DFG
 - 
                
                
                
“Equilibrium Learning, Uncertainty, and Dynamics.” About the Project Market interaction is increasingly automated by artificial learning agents. Examples include pricing agents in electronic retail or bidding
 - 
                
                
                
interdisciplinary team. Applicants with strong background in the following fields are preferred: Dynamical Systems Control Theory Formal Methods Machine Learning Context The applicant will be directly advised by Prof
 - 
                
                
                
that algorithmic parameters are tuned so that the over-approximation of the computed reachable set is small enough to verify a given specification. We will demonstrate our approach not only on ARCH benchmarks, but
 - 
                
                
                
: - QUANTITATIVE VERIFICATION: analysis of probabilistic systems (Markov decision processes, stochastic games, chemical reaction networks), automata theory and temporal logic, machine learning in verification
 - 
                
                
                
months but can be extended for another 24 months (extension is subject to a positive performance evaluation). About us… Founded in 2002, TUM School of Management is part of TUM, one of the leading