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
-
theory, Extremal Graph Theory, Combinatorial Optimization, Matroid Theory, and Algorithms. This appointment is for about two years, and the starting salary is no less than KRW 66,000,000. The appointment
-
The purpose of the project is to pursue research in pancake sorting, which is a well-known problem in combinatorial optimization which goes back up to a paper of Microsoft founder Bill Gates and Papadimitriou
-
Foundation, and the state of Hessen. Further collaboration opportunities at the Department of Mathematics of TU Darmstadt include: • Yann Disser (combinatorial optimization), • Kord Eickmeyer (structural graph
-
assignment of a research grant, with 1 position(s), under the project with the title “Multiple neighbourhood exploration in combinatorial optimisation”. Where to apply Website https://www.apply.uc.pt
-
assignment of a research grant, with 1 position, under the project “Distance-based search strategies in combinatorial optimisation”. Where to apply Website https://www.apply.uc.pt/ Requirements Research
-
Scientific Computing: Design and analyze quantum algorithms for optimization, combinatorial search, differential equations, scientific simulation, and other computational challenges arising in engineering
-
The successful candidate will work with Asst. Prof. Shen Shuting on combinatorial inference under a project on "Post-learning inference for near-optimal discrete structures". The main
-
(SEM), and other relevant methods; • Optimizing the synthesis of the most promising MOFs; • Writing reports, including literature reviews, progress reports, and project deliverables; • Participating in
-
education institution will be considered an asset, ability to teach, or to quickly prepare to teach, courses related to discrete mathematics, combinatorial optimization, fundamentals of programming
-
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