Sort by
Refine Your Search
-
Listed
-
Category
-
Country
-
Program
-
Employer
- Nature Careers
- CNRS
- Eindhoven University of Technology (TU/e)
- Eindhoven University of Technology (TU/e); Eindhoven
- KTH Royal Institute of Technology
- Northeastern University
- Stanford University
- Technical University of Denmark
- University of Pennsylvania
- ;
- CEA
- Erasmus University Rotterdam
- Fraunhofer-Gesellschaft
- Ghent University
- Institute for Basic Science
- Johannes Kepler University
- KINGS COLLEGE LONDON
- King's College London
- Medical College of Wisconsin
- Minnesota State University
- NIST
- Nanyang Technological University
- Technical University of Munich
- UNIVERSITY OF HELSINKI
- UNIVERSITY OF VIENNA
- University of British Columbia
- University of Idaho
- University of Kansas Medical Center
- University of Liverpool
- University of Michigan
- University of Vienna
- 21 more »
- « less
-
Field
-
combinatorial optimization problems better than purely classical methods. Possible topics for a master's thesis include, for example, distinguishing between hard and easy problem instances based on their graph
-
of the following: heuristic search methods (e.g., Tabu Search), combinatorial optimization, mixed-integer programming (MIP), or algorithmic market design. Experience working within multi-component
-
algorithmic systems or large-scale computational frameworks, with hands-on experience in one or more of the following: heuristic search methods (e.g., Tabu Search), combinatorial optimization, mixed-integer
-
with chemists and materials scientists is essential to ensure that the developed methods make optimal use of domain expertise and integrate fully into “human in the loop” workflows. This post is
-
from outstanding candidates with expertise in Operations Research, Management Science and Business Analytics with a focus on fundamental research in combinatorial and stochastic optimization for business
-
candidates with expertise in Operations Research, Management Science and Business Analytics with a focus on fundamental research in combinatorial and stochastic optimization for business applications. In
-
PhD Position in Theoretical Algorithms or Graph and Network Visualization - Promotionsstelle (m/w/d)
geometry, algorithmic complexity, and combinatorial optimization. Our contributions are regularly published in top venues like the Conference on Artificial Intelligence (AAAI), the Symposium on Algorithms
-
essential to ensure that the developed methods make optimal use of domain expertise and integrate fully into ¿human in the loop¿ workflows. This post is available for two years. Keywords: Geometric Deep
-
essential to ensure that the developed methods make optimal use of domain expertise and integrate fully into “human in the loop” workflows. This post is available for two years. Keywords: Geometric Deep
-
. You will draw on ideas from Bayesian optimization and Bayesian deep learning, generative modelling, high throughput screening, and combinatorial synthetic chemistry. Responsibilities and qualifications