Sort by
Refine Your Search
-
Listed
-
Country
-
Employer
- Nature Careers
- Nanyang Technological University
- Stanford University
- University of Lund
- University of Southern Denmark
- Auburn University
- Chalmers University of Technology
- Institute for Basic Science
- Lunds universitet
- NIST
- Northeastern University
- Oak Ridge National Laboratory
- Simon Fraser University
- Tokyo University of Agriculture and Technology
- University of Bergen
- University of Kansas Medical Center
- University of North Carolina at Charlotte
- University of Pennsylvania
- University of Texas at Dallas
- Université libre de Bruxelles (ULB)
- Washington State University
- Örebro University
- 12 more »
- « less
-
Field
-
Statistics section, include: Algorithms , focusing on online and approximation algorithms, graph and parameterized algorithms, string algorithms, data structures, combinatorial optimization, algorithmic
-
modeling, power/performance optimization, and energy-aware scheduling; Knowledge of optimization methods (e.g., convex optimization, combinatorial optimization, reinforcement learning) for energy management
-
implementation, targeting emerging computing hardware. You will also evaluate these ideas in real-world domains such as signal processing and combinatorial optimization, where efficient solutions can have major
-
optimization, including integer, nonlinear, and combinatorial optimization; global and non-convex optimization; machine learning for optimization; explainable artificial intelligence; heuristic and metaheuristic
-
considered, preference may be given to applicants whose work bridges theory and applications in data analysis, discrete mathematics, linear algebra, or optimization, and they are especially encouraged to apply
-
Tenure-track Assistant and Associate Professorship positions in Algorithms at the Department of M...
, combinatorial optimization, cryptology, data structures, fine-grained complexity, and algorithmic research bridging to ML/AI. Tenure-track Assistant Professorship Position Successful candidates for a tenure-track
-
are, for instance, active in the fields of incidence geometry, abstract polytopes, discrete optimization, graph theory, convex polytopes, non-commutative algebra, (non-commutative) algebraic geometry, homological
-
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
-
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
-
Scientific Computing Research. We are seeking applications from researchers in the broad domain of computational and applied mathematics, including algorithm analysis, artificial intelligence, combinatorial