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.
Смотрите видео Competitive Analysis of Online Algorithms (Part 1) онлайн без регистрации, длительностью часов минут секунд в хорошем качестве. Это видео добавил пользователь Simons Institute 01 Январь 1970, не забудьте поделиться им ссылкой с друзьями и знакомыми, на нашем сайте его посмотрели 10,286 раз и оно понравилось 21 людям.