Sort by
Refine Your Search
-
Listed
-
Category
-
Country
-
Program
-
Field
-
collaboration with the Intelligent Maintenance and Operations Systems (IMOS) Laboratory at EPFL (Prof. Olga Fink). IMOS focuses on the development of intelligent algorithms designed to improve the performance
-
collaboration with the Intelligent Maintenance and Operations Systems (IMOS) Laboratory at EPFL (Prof. Olga Fink). IMOS focuses on the development of intelligent algorithms designed to improve the performance
-
: extremal graph theory, Ramsey theory, probabilistic combinatorics. • Candidates should have (or be near completion of) a PhD in mathematics. • Candidates should have a strong research record in Combinatorics
-
. The broader research environment also includes the EPSRC-funded AI hub for Chemistry (AIchemy), Co-Directed by Prof. Jelfs. For those with significant experience as a Research Associate, there is the
-
, and heterogeneity of 6G networks, for their analysis and optimization, we use tools such as artificial intelligence/machine learning, quantum conputing, graph theory, graph-signal processing, and
-
networks, for their analysis and optimization, we use tools such as artificial intelligence/machine learning, graph theory and graph-signal processing, and convex/non-convex optimization. Furthermore, our
-
Group (ECOPRO) Fellowship Type: Postdoctoral Fellowship Location: Daejeon, Daejeon 34126, Korea, The Republic of [map ] Subject Areas: Extremal and Probabilistic Combinatorics, Graph Theory, discrete
-
and optimization, we use tools such as artificial intelligence/machine learning, quantum conputing, graph theory, graph-signal processing, and convex/non-convex optimization. Furthermore, our activities
-
environment also includes the EPSRC-funded AI hub for Chemistry (AIchemy), Co-Directed by Prof. Jelfs. For those with significant experience as a Research Associate, there is the possibility to be appointed
-
/undertaking dr hab. Szymon Toruńczyk Description of programme/project/undertaking The combination of methods from logic and graph theory has been extremely successful in the design of algorithms, in complexity