Sort by
Refine Your Search
-
"prophet inequalities (a mathematical optimization problem) and their applications in computer science and economics." "Prophet inequality (mathematical optimisation problem) and their applications in
-
research areas include, but are not limited to, approximation algorithms, combinatorial optimization, cryptology, data structures, fine-grained complexity, and algorithmic research bridging to ML/AI. Tenure
-
are encouraged, but priority will be given to applications in the following areas: Applied Analysis and Partial Differential Equations (contact: Razvan Fetecau and Weiran Sun); Combinatorial Optimization (contact
-
Scientific Computing Research. We are seeking applications from researchers in the broad domain of computational and applied mathematics, including algorithm analysis, artificial intelligence, combinatorial
-
Experience in developing heuristic and exact methods (e.g., branch-and-bound/branch-and-cut) to address combinatorial optimization problems pertaining to the fields of operations management and logistics
-
independently to support various research projects. Your work will focus primarily on providing molecular biology support, combinatorial library construction, protein production, tissue culture, and high
-
independently to support various research projects. Your work will focus primarily on providing molecular biology support, combinatorial library construction, protein production, tissue culture, and high
-
expertise in Operations Research, Management Science and Business Analytics with a focus on fundamental research in combinatorial and stochastic optimization for business applications. In teaching, the
-
-author and/or independently draft sections of research manuscripts. Guide/make recommendations for optimal lab operations, administration, and training. Regularly trains and oversees the work of others in
-
combinatorial optimization problems better than purely classical methods. Possible topics for a master's thesis include, for example, distinguishing between hard and easy problem instances based on their graph