Sort by
Refine Your Search
-
Listed
-
Category
-
Country
-
Employer
- Nature Careers
- DAAD
- Leibniz
- Umeå University
- ;
- Technical University of Munich
- University of Luxembourg
- University of Southern Denmark
- Vrije Universiteit Brussel
- ; Coventry University Group
- ; Cranfield University
- ; The University of Manchester
- ; University of Birmingham
- ; University of Leeds
- ; University of Warwick
- Cranfield University
- Forschungszentrum Jülich
- Leipzig University •
- Molde University College
- Monash University
- Technical University of Denmark
- Universiteit van Amsterdam
- University of Adelaide
- University of Antwerp
- University of Twente
- VIB
- WIAS Berlin
- 17 more »
- « less
-
Field
-
networks, for their analysis and optimization, we use tools such as artificial intelligence/machine learning, graph theory and graph-signal processing, and convex/non-convex optimization. Furthermore, our
-
at the Faculty of Mathematics at TUD. Tasks: generation of hyper uniform patterns (point, scalar and vector fields) application of topological data analysis tools such as persistent homology and graph statistics
-
covers kinetic theory, non-local diffusion and dynamics on graphs. The precise research direction will be determined together with the successful candidate upon personal background and interests
-
: algorithmics, graph transformation and algorithm engineering. Exposure to systems chemistry or systems biology is an asset but not a must. Proven competences in programming and ease with formal thinking are a
-
Recombination Graphs Comparative analysis of demographic trajectories between high- and low-altitude species Presentation of scientific results at international conferences Publication of peer reviewed papers in
-
-regulatory networks. Following cis-GRN network reconstruction and formal graph analysis, we will identify key regulatory factors governing cell-type specific response to CMT-causing mutations. Finally, we will
-
. The current research topics include disorder effects on phase transitions (diluted ferromagnets, long-range correlated defects, spin glasses, random graphs and networks), long-range interacting systems
-
, graph theory, satisfiability problems, discrete optimization. Strong interests in chemistry as well as proven competences in programming and ease with formal thinking are a necessity. This PhD project is
-
and polyploid crop species and benchmark them against other methods such as graph-based methods. This project will combine algorithm development and computational programming with large population
-
. Alternative approaches are graph-based molecule reaction space sampling and generative machine learning as they provide a path to new synthetic data that can form the basis for a large-scale database of