Teaching
M1 Math ENS Cachan - Apprentissage statistique
|
TD6. Maximum Likelihood and Data-Dependant Partitioning. |
|
|
TD5. Random Forests and Averaging Classifiers. |
|
|
TD4. The Nearest Neighbor Rule. |
|
|
TD3. Risk Minimization. |
|
|
TD2. Online Learning. |
|
|
TD1. Concentration inequalities. |
MPRI 1.24 - Probabilistic aspects of computer science
|
|
TD8. Probabilistic Automata. |
|
|
TD7. MDP - Average reward for unichains. |
|
|
TD6. MDP - Reachability objectives. |
|
|
TD5. MDP - Modelling and finite-horizon objectives. |
|
|
TD4. Continuous-time Markov chains. |
|
|
TD3. Random walks and applications. |
|
|
TD2. Markov chains in the long run. |
|
|
TD1. Discrete-time Renewal Processes and First Markov Chains. |
L3 Info ENS Cachan - Projet Programmation 2
|
|
Partie 3. Des générateurs d'instances. |
|
|
Partie 2. Une petite collection de jeux à un joueur. |
|
|
Partie 1. Interface graphique et Démineur. |