Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
Covers a review of past exams on distributed algorithms, focusing on key concepts such as Terminating Reliable Broadcast, Consensus, and Leader Election.
Covers heuristic and formative evaluation methods for interactive systems, emphasizing error prevention, user control, consistency, and flexibility in design.
Explores belief propagation, frozen clusters, and colorability thresholds in graphical models, leading to the significance of survey propagation in solving constraint satisfaction problems.
