Sort by
Refine Your Search
-
Listed
-
Category
-
Country
-
Employer
- Cranfield University
- Technical University of Denmark
- Technical University of Munich
- Forschungszentrum Jülich
- ;
- Nature Careers
- Monash University
- Chalmers University of Technology
- Curtin University
- DAAD
- Ghent University
- University of Groningen
- Leiden University
- NTNU - Norwegian University of Science and Technology
- Umeå University
- University of Adelaide
- University of Southern Denmark
- Vrije Universiteit Brussel
- ; Newcastle University
- ; Swansea University
- ; Technical University of Denmark
- ; The University of Manchester
- Imperial College London
- Radboud University
- University of Cambridge
- University of Nottingham
- ; University of Bristol
- ; University of Cambridge
- ; University of Exeter
- ; University of Leeds
- Aalborg University
- Aarhus University
- Leibniz
- Linköping University
- Susquehanna International Group
- University of Antwerp
- University of Luxembourg
- University of Southern Queensland
- University of Twente
- Utrecht University
- ; Brunel University London
- ; University of Birmingham
- ; University of East Anglia
- ; University of Nottingham
- ; University of Oxford
- ; University of Sheffield
- ; University of Southampton
- ; University of Surrey
- CSIRO
- Deutsches Elektronen-Synchrotron DESY •
- Erasmus University Rotterdam
- Harper Adams University
- Helmholtz-Zentrum Geesthacht
- Institut Pasteur
- Leibniz-Institute for Plant Genetics and Crop Plant Research
- Lulea University of Technology
- Max Planck Institute for Molecular Genetics •
- Max Planck Institutes
- McGill University
- Purdue University
- Queensland University of Technology
- SciLifeLab
- TU Dresden
- Trinity College Dublin
- University of Bern
- University of Bremen •
- University of Copenhagen
- University of Glasgow
- University of Minnesota
- University of Minnesota Twin Cities
- University of Nebraska–Lincoln
- University of Oslo
- University of Potsdam •
- University of Texas at Austin
- Uppsala University
- Wageningen University and Research Center
- 66 more »
- « less
-
Field
-
Multi-omics data integration and workflow improvement Development and application of machine learning-based algorithms for the identification of antibiotics-associated proteins and antimicrobial
-
PhD Position in Theoretical Algorithms or Graph and Network Visualization - Promotionsstelle (m/w/d)
31.07.2025, Wissenschaftliches Personal The Chair for Efficient Algorithms, led by Prof. Stephen Kobourov, is inviting applications for a fully funded PhD position at the Technical University
-
Approximation. Parameterized Complexity is a vastly growing area within theoretical computer science that allows for the development of exact and approximation algorithms for computationally hard problems by
-
: Develop an event-driven RL algorithm that sparsely updates network state and parameters that will significantly improve energy to-solution efficiency compared to conventional digital accelerators when
-
, MIT and 12 other partners to build an AI Partner in Engineering (AIPE) that converses with engineers, proposes designs, explains its reasoning and even writes new optimisation algorithms to optimize
-
. Responsibility: * Develop or integrate novel statistical methods and algorithms for analyzing large-scale -omics data, including gene regulatory network inference, cell lineage reconstruction, multi-dimensional
-
sustainability goals whilst improving operational efficiency? This PhD studentship will involve developing machine learning models, creating virtual manufacturing replicas, and implementing optimisation algorithms
-
information into versatile benchmarks supporting development of a new generation of assured PNT systems. Positioning, navigation, and timing (PNT) underpin modern transportation, logistics, and critical
-
optimisation algorithms to optimize the designs. We now hire three PhD candidates who be based at LIACS (Leiden University) and spend several months with industry and academic partners abroad. The GenAIDE
-
– depending on the successful candidate’s background and interests. Your tasks: Develop new exact and approximation algorithms and perform complexity analyses for optimization problems on (temporal) graphs