0


竞争分析:自我组织

Competitive Analysis: Self-organizing
课程网址: http://videolectures.net/mit6046jf05_leiserson_lec14/  
主讲教师: Leiserson Charles E
开课单位: 麻省理工学院
开课时间: 2009-02-10
课程语种: 英语
中文简介:
这将使用我们上次学习的有关摊余分析的一些技术。而且,我们今天要讨论的最有趣的是,它是一种比较算法的方法,即所谓的在线算法。我们将用一个叫做自组织列表的问题来介绍这个概念。好的,所以这个问题的设置是我们有一个n元素的列表,l。我们还有一个手术。呜呜,我必须把事情拼对,访问x,它访问列表中的项x…";
课程简介: "And this is going to use some of the techniques we learned last time with respect to amortized analysis. And, what's neat about what we're going to talk about today is it's a way of comparing algorithms that are so-called online algorithms. And we're going to introduce this notion with a problem which is called self organizing lists. OK, and so the set up for this problem is that we have a list, L, of n elements. And, we have an operation. Woops, I've got to spell things right, access of x, which accesses item x in the list..."
关 键 词: 摊销分析; 比较算法; 自组织列表
课程来源: 视频讲座网
最后编审: 2020-04-08:chenxin
阅读次数: 44