Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
This lecture covers the application of Markov chains and algorithms, focusing on the Metropolis-Hastings algorithm and simulated annealing for function optimization and graph colorings. It explains the process of applying these algorithms and their significance in finding global minima.