图 书 馆
在线算法的原始对偶方法The Primal-Dual approach for Online Algorithms |
|
| 课程网址: | http://videolectures.net/algo2012_bansal_online_algorithms/ |
| 主讲教师: | Nikhil Bansal |
| 开课单位: | 埃因霍温理工大学 |
| 开课时间: | 信息不详。欢迎您在右侧留言补充。 |
| 课程语种: | 英语 |
| 中文简介: |  |
| 课程简介: | Online algorithms deal with settings where the input data arrives over time and the current decision must be made by the algo- rithm without the knowledge of future input. In the last few years, the online primal-dual approach, pioneered by Buchbinder and Naor, has emerged as a very powerful and general method to systematically design and analyze online algorithms. In this talk, I will give an overview of the method and show how it uni es and simpli es various previous results. I will also describe the recent successes of this approach in addressing some classic problems such as weighted paging and the randomized k-server problem. Finally, we will also see some recent extensions of the method. |
| 关 键 词: | 在线算法处理设置; 网络对偶; 知识输入方法 |
| 课程来源: | 视频讲座网 |
| 最后编审: | 2019-11-17：cwx |
| 阅读次数: | 78 |