Sort by
Refine Your Search
-
Country
-
Employer
- University of Vienna
- Carnegie Mellon University
- ETH Zurich
- INESC COIMBRA - INSTITUTO DE ENGENHARIA DE SISTEMAS E COMPUTADORES DE COIMBRA
- KU LEUVEN
- Minnesota State University
- Monash University
- NIST
- Northeastern University
- Poznan University of Technology
- Technical University Darmstadt
- The University of Chicago
- Universitat Politècnica de València
- University of Zagreb, Faculty of Electrical Engineering and Computing
- Université de Limoges
- 5 more »
- « less
-
Field
-
IP-2025-02-8486 “Neural Combinatorial Optimization for Software Defect Prediction”- one full-time fixed-term position (for a limited period until November, 2027). Working conditions and other details
-
specialized domains, such as Tabular Foundation Models. The core principle of these neural network models is that they are optimized for a specific form of data; in the case of tabular data, for instance
-
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
-
process for an indefinite employment contract within the framework of a Line of Research: R&D line: Development of Search Techniques in Combinatorial Optimization Problems https://www.upv.es/entidades/SRH
-
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
-
academic and industrial research. The topic 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
-
. Responsibilities: Younis Lab: 1-Conducting experiments on the role of minor intron splicing in breast cancer. 2- Setup and optimize new techniques, including but not limited to immuno- fluorescence and colony
-
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