Concept
Problème algorithmique
Cours associés (13)
CIVIL-557: Decision-aid methodologies in transportation
The course has two modules, the first Operations Research (OR), and the second is statistical modeling of transportation systems. Students will be modeling applied problems and developing solution met
MGT-487: Complex problem solving in organizations
As a professional you will need to solve all sorts of complex problems, requiring you to think strategically. This course develops your strategic thinking skills by giving you a three-step process and
EE-735: Online learning in games
This course provides an overview of recent developments in online learning, game theory, and variational inequalities and their point of intersection with a focus on algorithmic development. The prima
CS-308: Introduction to quantum computation
The course introduces the paradigm of quantum computation in an axiomatic way. We introduce the notion of quantum bit, gates, circuits and we treat the most important quantum algorithms. We also touch
ME-454: Modelling and optimization of energy systems
The goal of the lecture is to present and apply techniques for the modelling and the thermo-economic optimisation of industrial process and energy systems. The lecture covers the problem statement, th
ME-232: Mechanics of structures (For GM)
L'étudiant acquiert les bases de l'analyse des contraintes et déformation des poutres élastiques linéaires soumises à la traction, cisaillement, torsion, flexion; les coefficients d'influence et la m
COM-621: Advanced Topics in Information Theory
The class will focus on information-theoretic progress of the last decade. Topics include: Network Information Theory ; Information Measures: definitions, properties, and applications to probabilistic
MGT-418: Convex optimization
This course introduces the theory and application of modern convex optimization from an engineering perspective.
CS-101: Advanced information, computation, communication I
Discrete mathematics is a discipline with applications to almost all areas of study. It provides a set of indispensable tools to computer science in particular. This course reviews (familiar) topics a
MATH-512: Optimization on manifolds
We develop, analyze and implement numerical algorithms to solve optimization problems of the form min f(x) where x is a point on a smooth manifold. To this end, we first study differential and Riemann