跳至内容
Optimal binary trees in online algorithms 線上預覽
關閉線上預覽
正在查...

Optimal binary trees in online algorithms

作者: Daniel D Sleator; M Talupur
出版商: Pittsburgh, Pa. : School of Computer Science, Carnegie Mellon University, [2002]
叢書: Research paper (Carnegie Mellon University. School of Computer Science), CMU-CS-02-148.
版本/格式:   圖書 : 英語
資料庫:WorldCat
提要:
Abstract: "Some binary search tree algorithms, such as splay trees, structure the tree in a way that depends on the history of accesses. In this paper we consider what happens if at each point in time the optimal binary search tree (for the access frequencies seen so far) is maintained. We prove lower and upper bounds on the competitive ratio (with respect to the final optimal tree) of such an algorithm."
評定級別:

(尚未評分) 0 附有評論 - 成爲第一個。

主題
更多類似這樣的

 

在圖書館查詢

&AllPage.SpinnerRetrieving; 正在查詢有此資料的圖書館...

詳細書目

文件類型: 圖書
所有的作者/貢獻者: Daniel D Sleator; M Talupur
OCLC系統控制編碼: 52156499
注意: "September 2002."
描述: 7 p. ; 28 cm.
叢書名: Research paper (Carnegie Mellon University. School of Computer Science), CMU-CS-02-148.
責任: D. Sleator and M. Talupur.

摘要:

Abstract: "Some binary search tree algorithms, such as splay trees, structure the tree in a way that depends on the history of accesses. In this paper we consider what happens if at each point in time the optimal binary search tree (for the access frequencies seen so far) is maintained. We prove lower and upper bounds on the competitive ratio (with respect to the final optimal tree) of such an algorithm."

評論

讀者提供的評論
正在擷取GoodReads評論...
正在擷取DOGObooks的評論

標籤

成爲第一個
確認申請

你可能已經申請過這份資料。若還是想申請,請選確認。

連結資料


<http://www.worldcat.org/oclc/52156499>
library:oclcnum"52156499"
library:placeOfPublication
library:placeOfPublication
rdf:typeschema:Book
schema:about
schema:about
<http://id.worldcat.org/fast/831860>
rdf:typeschema:Intangible
schema:name"Binary control systems"@en
schema:name"Binary control systems."@en
schema:about
schema:contributor
schema:creator
schema:datePublished"2002"
schema:description"Abstract: "Some binary search tree algorithms, such as splay trees, structure the tree in a way that depends on the history of accesses. In this paper we consider what happens if at each point in time the optimal binary search tree (for the access frequencies seen so far) is maintained. We prove lower and upper bounds on the competitive ratio (with respect to the final optimal tree) of such an algorithm.""@en
schema:exampleOfWork<http://worldcat.org/entity/work/id/9136071>
schema:inLanguage"en"
schema:isPartOf
schema:name"Optimal binary trees in online algorithms"@en
schema:numberOfPages"7"
schema:publication
schema:publisher
wdrs:describedby

Content-negotiable representations

關閉視窗

請登入WorldCat 

没有帳號嗎?你可很容易的 建立免費的帳號.