Sort by
Refine Your Search
-
Listed
-
Category
-
Country
-
Program
-
Field
-
limited to artificial intelligence, computing theory (algorithms, complexity), data science, statistics, discrete mathematics (graph theory, combinatorics), game theory, machine learning, optimization
-
and technical computing, such as Python, Matlab and STK is recommended; knowledge and background in network architectures, graph theory and radionavigation are an asset. Topic 2 experience in using
-
Massachusetts Institute of Technology (MIT) | Cambridge, Massachusetts | United States | about 1 month ago
. Having taken at least one course on dynamic programming, convex optimization, portfolio theory, or deep learning will be advantageous. Strong programming skills and experience, especially in Python, MATLAB
-
the doctoral level. More than 20 percent of its 25,000 students are enrolled in graduate course work, studying in disciplines ranging from atomic physics and graph theory to medieval literature and blind
-
use tools such as artificial intelligence/machine learning, graph theory and graph-signal processing, and convex/non-convex optimization. Furthermore, our activities are experimentally driven and
-
are passionate about any or all of the following: Data Science, Computational Social Science, Behavioral Economics, Human-Bot interaction, Experimental Research, Game Theory, and Artificial Intelligence. Some of
-
-doctoral associate to work on one or more of the following topics: Mathematical Physics, Spectral Theory, Quantum Chaos, Large Graphs and Quantum Walks. Related areas such as Quantum Information can also be
-
, 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
-
Discrete Mathematics and conduct research related to problems in Combinatorics, Graph theory and aspects of the Constraint Satisfaction Problem (CSP) with emphasis on topological methods. Further