Competitive Analysis of Online Algorithms (Part 1)
Anupam Gupta (Carnegie Mellon University)
https://simons.berkeley.edu/talks/com...
Data-Driven Decision Processes Boot Camp
The study of online algorithms forms a vibrant area of research in computer science, considering decision-making under uncertainty. One of the two dominant frameworks is that of competitive analysis. This framework compares the performance of an online algorithm making decisions (without knowledge of the future) to the performance of the best (dynamic) sequence of decisions in hindsight. (This is as opposed to the best static decision.) In these two talks, I will define the model, and survey some representative problems, solution techniques, and proof strategies used in the competitive analysis of online algorithms.
Watch video Competitive Analysis of Online Algorithms (Part 1) online without registration, duration hours minute second in high quality. This video was added by user Simons Institute 01 January 1970, don't forget to share it with your friends and acquaintances, it has been viewed on our site 10,28 once and liked it 2 people.