Sort by
Refine Your Search
-
Listed
-
Category
-
Country
-
Program
-
Employer
- KU LEUVEN
- CNRS
- Universidade de Coimbra
- University of Vienna
- Carnegie Mellon University
- ETH Zurich
- ETH Zürich
- Forschungszentrum Jülich
- George Washington University
- INESC COIMBRA - INSTITUTO DE ENGENHARIA DE SISTEMAS E COMPUTADORES DE COIMBRA
- Institute for Basic Science
- Max Planck Institute for Dynamics of Complex Technical Systems, Magdeburg
- Minnesota State University
- Monash University
- NIST
- National University of Singapore
- Northeastern University
- Pennsylvania State University
- Poznan University of Technology
- Technical University Darmstadt
- The University of Chicago
- The University of Queensland
- Umeå universitet stipendiemodul
- Universitat Politècnica de València
- University of Idaho
- University of Zagreb, Faculty of Electrical Engineering and Computing
- Université de Limoges
- 17 more »
- « less
-
Field
-
of the PhD position sits at the crossroads of quantum computing, machine learning, and combinatorial optimization — an area where some of the most exciting and open questions in the field live. Research
-
and determination? We are currently seeking a/an 2 University assistants predoctoral (group "Algorithms and Optimization") 39 Faculty of Computer Science Startdate: 01.10.2026 | Working hours: 30
-
extraction, no fast decoder, and they themselves suggest generalizing rank-metric LRPC codes instead [2]. Problem statement. Gabidulin codes, optimal in the Singleton-bound sense, suffer from two well-known
-
and determination? We are currently seeking a/an 2 University assistants predoctoral (group "Algorithms and Optimization") 39 Faculty of Computer Science Job vacancy starting: 01.10.2026 (MM-DD-YYYY
-
INESC COIMBRA - INSTITUTO DE ENGENHARIA DE SISTEMAS E COMPUTADORES DE COIMBRA | Portugal | 3 months ago
combinatorial complexity of the problem, treatment planning will be formulated as a large-scale optimization problem involving both discrete variables (beam selection and orientation) and continuous variables
-
including differential equation solving, simulation of quantum systems, combinatorial optimization, machine learning and data analysis, or quantum computational sensing. Experience analysing quantum
-
systems, graphs play a central role in both theoretical and applied computer science. Complexity theory indicates that the design of efficient algorithms relies on exploiting the intrinsic combinatorial
-
approaches. Apply hybrid optimisation techniques (e.g., quantum-inspired or QAOA-based methods) to determine optimal intervention strategies under resource constraints. Compare the performance, scalability
-
algorithms for combinatorial optimization problems, using portfolio optimization as a representative example Systematic benchmarking of the developed methods on available quantum hardware and hybrid QC-HPC
-
University Seattle campus. Course topics include High-performance Computing, VLSI Design, Advanced Machine, Learning Combinatorial Optimization and Statistical Inference. Responsibilities include preparation