Sort by
Refine Your Search
-
Listed
-
Category
-
Country
-
Field
-
SD- 26053 PHD IN ULTRA-FAST MACHINE-LEARNING INTERATOMIC POTENTIALS FOR NANOINDENTATION OF TIC MA...
will not be used for any discriminatory purposes. LIST is dedicated to maintaining an inclusive work environment and is an equal opportunity employer. We are committed to attracting, hiring, and
-
will not be used for any discriminatory purposes. LIST is dedicated to maintaining an inclusive work environment and is an equal opportunity employer. We are committed to attracting, hiring, and
-
or Computer Science. Other related degrees (such as ML/AI) will also be considered. You should have excellent written and verbal communication skills in English. A strong background in graph theory and graph algorithms
-
(hep-ph) , HEP-Theory (hep-th) , Lattice Field Theory , Machine Learning , Particle Physics , Physics-informed machine learning , Quantum Computation , Quantum Information , Quantum Information
-
the subject label "Postdoc CFM- Theory of Nanophotonics": 1- An updated Curriculum Vitae, including a list of publications. ( 70 %) 2- A presentation letter with declaration of interests (max. 1 page). ( 15
-
at the University of Twente is looking for two PhD candidates to join the research team of Dr. Gaurav Rattan. The positions are funded by the NWO VIDI project Learning on Graphs: Symmetry Meets Structure (LOGSMS
-
English. A strong background in graph theory and graph algorithms is necessary. For PhD position 1, we appreciate prior mathematical exposure to at least one of the following topics: random graphs
-
[map ] Subject Areas: Number theory and/or additive cominatorics Appl Deadline: 2026/01/02 11:59PM (posted 2025/11/27, listed until 2026/03/30) Position Description: Apply Position Description
-
or performance-based approaches is considered an advantage. Previous knowledge of gender studies and architectural theory is also an advantage. Terms of employment The appointment aims at a doctoral degree, and
-
Transactions on Information Theory, vol. 56, no. 5, p. 2307, 2010. [4] W. Yang, R. F. Schaefer, and H. V. Poor, “Wiretap channels: Nonasymptotic fundamental limits,” IEEE Transactions on Information Theory, vol