Parisian Master of Research in Computer Science
Master Parisien de Recherche en Informatique (MPRI)

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

cours:c-2-24-2 [2019/09/09 10:19]
durr [Lectures (Tentative Schedule)]
cours:c-2-24-2 [2019/09/09 10:19] (current)
durr [Lectures (Tentative Schedule)]
Line 36: Line 36:
 ==== Lectures (Tentative Schedule) ====  ==== Lectures (Tentative Schedule) ==== 
  
- **4.12.2018** [Carola] Introduction to heuristic search, motivation, applications, the role of mathematical investigations and a fundamental "theory dilemma". Discussion of the course project. + **4.12.2019** [Carola] Introduction to heuristic search, motivation, applications, the role of mathematical investigations and a fundamental "theory dilemma". Discussion of the course project. 
    
-**11.12.2018**  [Carola] Analysis of iterative optimization heuristics: performance measures, tools and techniques, hot topics, algorithm-specific performance bounds+**11.12.2019**  [Carola] Analysis of iterative optimization heuristics: performance measures, tools and techniques, hot topics, algorithm-specific performance bounds
    
-**18.12.2018** [Carola] The parameter selection problem: offline vs. online algorithm configuration+**18.12.2019** [Carola] The parameter selection problem: offline vs. online algorithm configuration
  
-**8.1.2019**  [Carola] Black-box complexity: lower bounds for selected classes of iterative optimization heuristics+**8.1.2020**  [Carola] Black-box complexity: lower bounds for selected classes of iterative optimization heuristics
  
- **15.1.2019** [Christoph] Local search : 2-approximation for scheduling with precedence relations, Schöning’s randomized local search for 3-SAT, local search for k-median. en français: {{:cours:upload:2-24-2-notes-1.pdf|notes 1}}, in english [[https://arxiv.org/abs/0809.2554|simpler proof by Gupta and Tangwongsan'2008]]+ **15.1.2020** [Christoph] Local search : 2-approximation for scheduling with precedence relations, Schöning’s randomized local search for 3-SAT, local search for k-median. en français: {{:cours:upload:2-24-2-notes-1.pdf|notes 1}}, in english [[https://arxiv.org/abs/0809.2554|simpler proof by Gupta and Tangwongsan'2008]]
    
-**22.1.2019** [Christoph] degree constrained minimum spanning tree, [[http://www.designofapproxalgs.com/book.pdf|Williamson, Shmoys: The Design of Approximation Algorithms]] page 49, section 2.6+**22.1.2020** [Christoph] degree constrained minimum spanning tree, [[http://www.designofapproxalgs.com/book.pdf|Williamson, Shmoys: The Design of Approximation Algorithms]] page 49, section 2.6
 then page 243, section 9.3.  then page 243, section 9.3. 
    
-**29.1.2019** [Christoph] Markov Chain Monte Carlo search.  If needed [[http://web.stanford.edu/class/cs168/l/l13.pdf|introduction]] to Markov and Chebychev inequalities. Markov chains [[https://web.stanford.edu/class/cs168/l/l14.pdf|light]], and [[https://www.win.tue.nl/~jkomjath/SPBlecturenotes.pdf|heavy introduction]]. Application to [[https://people.eecs.berkeley.edu/~sinclair/cs294/n8.pdf|lozenge tilings]]+**29.1.2020** [Christoph] Markov Chain Monte Carlo search.  If needed [[http://web.stanford.edu/class/cs168/l/l13.pdf|introduction]] to Markov and Chebychev inequalities. Markov chains [[https://web.stanford.edu/class/cs168/l/l14.pdf|light]], and [[https://www.win.tue.nl/~jkomjath/SPBlecturenotes.pdf|heavy introduction]]. Application to [[https://people.eecs.berkeley.edu/~sinclair/cs294/n8.pdf|lozenge tilings]]
  
  
-**5.2.2019** (no lecture, deadline for submitting the documentation of the course project/homework)+**5.2.2020** (no lecture, deadline for submitting the documentation of the course project/homework)
  
-**12.2.2019** [Carola+Christoph] Project/Homework presentations, discussions+**12.2.2020** [Carola+Christoph] Project/Homework presentations, discussions
    
-**19.2.2019** (no lecture)+**19.2.2020** (no lecture)
  
-**4.3.2019** exam+**4.3.2020** exam
  
 ==== Grading and Homework ====  ==== Grading and Homework ==== 
 
Universités partenaires Université Paris-Diderot
Université Paris-Saclay
ENS Cachan École polytechnique Télécom ParisTech
ENS
Établissements associés Université Pierre-et-Marie-Curie CNRS INRIA CEA