Sort by
Refine Your Search
-
Listed
-
Category
-
Country
-
Employer
- Umeå University
- University of Luxembourg
- Nature Careers
- University of Groningen
- ;
- ; University of Exeter
- Associação do Instituto Superior Técnico para a Investigação e Desenvolvimento _IST-ID
- Chalmers University of Technology
- Delft University of Technology (TU Delft)
- IMT Atlantique
- Leiden University
- Leipzig University •
- Monash University
- NTNU - Norwegian University of Science and Technology
- SciLifeLab
- University of Antwerp
- University of Cambridge
- University of Southern Denmark
- VIB
- 9 more »
- « less
-
Field
-
use tools such as artificial intelligence/machine learning, graph theory and graph-signal processing, and convex/non-convex optimization. Furthermore, our activities are experimentally driven and
-
supervised by Sebastian Throm. The subject area of the announced position covers kinetic theory, non-local diffusion and dynamics on graphs. The precise research direction will be determined together
-
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
-
We are offering a PhD position in the field of algorithmic graph theory. The position is a full-time employment with a competitive monthly salary and full social benefits for up to five years. You
-
Apply now The Mathematical Institute (MI) of Leiden University and the Leiden Institute of Advanced Computer Science (LIACS) are looking for a PhD Candidate in Random Graphs and Complex Networks
-
Carlo (MC), as well as quantum approaches like Density Functional Theory (DFT). Develop novel Graph Neural Network (GNN) potentials to accurately represent the catalytic behavior of specific species
-
the context of algorithmic problems related to constraint satisfaction and graph homomorphism and isomorphism problems. It brings to bear significant new mathematical (algebraic and topological) methods
-
the context of algorithmic problems related to constraint satisfaction and graph homomorphism and isomorphism problems. It brings to bear significant new mathematical (algebraic and topological) methods
-
previous experience with e-graphs, or is familiar with theory and algorithms used by, for example, proof assistants, term rewriting systems, optimizing compilers, program analysis tools, constraint solvers
-
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