MATH-261: Discrete optimizationThis course is an introduction to linear and discrete optimization.
Warning: This is a mathematics course! While much of the course will be algorithmic in nature, you will still need to be able to prove theorems. ...
PHYS-432: Quantum field theory IIThe goal of the course is to introduce relativistic quantum field theory as the conceptual and mathematical framework describing fundamental interactions such as Quantum Electrodynamics. ...
CS-450: Algorithms IIA first graduate course in algorithms, this course assumes minimal background, but moves rapidly. The objective is to learn the main techniques of algorithm analysis and design, while building a repertory of basic algorithmic solutions to problems in many ...
CS-250: Algorithms IThe students learn the theory and practice of basic concepts and techniques in algorithms. The course covers mathematical induction, techniques for analyzing algorithms, elementary data structures, major algorithmic paradigms such as dynamic programming, s ...
CS-455: Topics in theoretical computer scienceThe students gain an in-depth knowledge of several current and emerging areas of theoretical computer science. The course familiarizes them with advanced techniques, and develops an understanding of fundamental questions that underlie some of the key probl ...
ME-413: Introduction to additive manufacturingThe state of the art in the domain of additive production processes
(the part is built by material addition without use of a shape tool) will be presented.
The main application/benefits/shortcomings of the common additive processes as well as
technologi ...
MATH-225: Topology II - fundamental groupsOn étudie des notions de topologie générale: unions et quotients d'espaces topologiques; on approfondit les notions de revêtements et de groupe fondamental,et d'attachements de cellules et on démontre le Théorème de Seifert-van Kampen. Des exemples de surf ...
CS-341: Computer graphicsThe students study and apply fundamental concepts and algorithms of computer graphics for rendering, geometry
synthesis, and animation. They design and implement their own interactive graphics programs. ...
MATH-310: AlgebraThis is an introduction to modern algebra: groups, rings and fields. ...
PHYS-460: Nonlinear dynamics, chaos and complex systemsThe course provides students with the tools to approach the study of nonlinear systems and chaotic dynamics. Emphasis is given to concrete examples and numerical applications are carried out during the exercise sessions. ...
CS-457: Geometric computingThis course will cover mathematical concepts and efficient numerical methods for geometric computing. We will explore the beauty of geometry and develop algorithms to simulate and optimize 2D and 3D geometric models with an emphasis towards computational d ...
CS-472: Design technologies for integrated systemsHardware compilation is the process of transforming specialized hardware description languages into circuit descriptions, which are iteratively refined, detailed and optimized. The course presents algorithms, tools and methods for hardware compilation an ...
MATH-451: Numerical approximation of PDEsThe course is about the derivation, theoretical analysis and implementation of the finite element method for the numerical approximation of partial differential equations in one and two space dimensions. ...
CIVIL-423: Computational geomechanicsThe goal of this course is to introduce the student to modern numerical methods for the solution of coupled & non-linear problems arising in geo-mechanics / geotechnical engineering. ...
CH-120: Advanced general chemistry IIAcquisition des notions fondamentales liées à la réactivité des molécules organiques, identification de la structure de petites molécules organiques au moyen des techniques de spectrométrie de masse, spectroscopie infra-rouge et résonance magnétique nucléa ...
MATH-467: Probabilistic methods in combinatoricsThe 'probabilistic method' is a fundamental tool in combinatorics. The basic idea is as follows: to prove that an object (for example, graph) with certain properties exists, it suffices to prove that if the object is chosen at random, then it has the desir ...
AR-219: Advanced CAO and Integrated Modeling DIM1ère année: bases nécessaires à la représentation informatique 2D (3D).
Passage d'un à plusieurs logiciels: compétence de choisir les outils adéquats en 2D et en 3D.
Mise en relation des outils de CAO et DIM: regard critique et aptitude à choisir les métho ...
CS-448: Sublinear algorithmsIn this course we will define rigorous mathematical models for computing on large datasets, cover main algorithmic techniques that have been developed for sublinear (e.g. faster than linear time) data processing. We will also discuss limitations inherent t ...
