跳至内容
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.
版本/格式:   Print book : 英語
資料庫: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 pages ; 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的評論

標籤

成爲第一個
確認申請

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

連結資料


Primary Entity

<http://www.worldcat.org/oclc/52156499> # Optimal binary trees in online algorithms
    a schema:CreativeWork, schema:Book ;
   library:oclcnum "52156499" ;
   library:placeOfPublication <http://id.loc.gov/vocabulary/countries/pau> ;
   library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/9136071#Place/pittsburgh_pa> ; # Pittsburgh, Pa.
   schema:about <http://id.worldcat.org/fast/1045924> ; # Online algorithms
   schema:about <http://dewey.info/class/510.7808/> ;
   schema:about <http://id.worldcat.org/fast/831860> ; # Binary control systems
   schema:about <http://id.worldcat.org/fast/887978> ; # Data structures (Computer science)
   schema:bookFormat bgn:PrintBook ;
   schema:contributor <http://experiment.worldcat.org/entity/work/data/9136071#Person/talupur_m> ; # M. Talupur
   schema:creator <http://viaf.org/viaf/54241399> ; # Daniel Dominic Sleator
   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 <http://experiment.worldcat.org/entity/work/data/9136071#Series/research_paper_carnegie_mellon_university_school_of_computer_science> ; # Research paper (Carnegie Mellon University. School of Computer Science) ;
   schema:name "Optimal binary trees in online algorithms"@en ;
   schema:productID "52156499" ;
   schema:publication <http://www.worldcat.org/title/-/oclc/52156499#PublicationEvent/pittsburgh_pa_school_of_computer_science_carnegie_mellon_university_2002> ;
   schema:publisher <http://experiment.worldcat.org/entity/work/data/9136071#Agent/school_of_computer_science_carnegie_mellon_university> ; # School of Computer Science, Carnegie Mellon University
   wdrs:describedby <http://www.worldcat.org/title/-/oclc/52156499> ;
    .


Related Entities

<http://experiment.worldcat.org/entity/work/data/9136071#Agent/school_of_computer_science_carnegie_mellon_university> # School of Computer Science, Carnegie Mellon University
    a bgn:Agent ;
   schema:name "School of Computer Science, Carnegie Mellon University" ;
    .

<http://experiment.worldcat.org/entity/work/data/9136071#Person/talupur_m> # M. Talupur
    a schema:Person ;
   schema:familyName "Talupur" ;
   schema:givenName "M." ;
   schema:name "M. Talupur" ;
    .

<http://experiment.worldcat.org/entity/work/data/9136071#Place/pittsburgh_pa> # Pittsburgh, Pa.
    a schema:Place ;
   schema:name "Pittsburgh, Pa." ;
    .

<http://experiment.worldcat.org/entity/work/data/9136071#Series/research_paper_carnegie_mellon_university_school_of_computer_science> # Research paper (Carnegie Mellon University. School of Computer Science) ;
    a bgn:PublicationSeries ;
   schema:hasPart <http://www.worldcat.org/oclc/52156499> ; # Optimal binary trees in online algorithms
   schema:name "Research paper (Carnegie Mellon University. School of Computer Science) ;" ;
   schema:name "[Research paper] / Carnegie Mellon University. School of Computer Science ;" ;
    .

<http://id.worldcat.org/fast/1045924> # Online algorithms
    a schema:Intangible ;
   schema:name "Online algorithms"@en ;
    .

<http://id.worldcat.org/fast/831860> # Binary control systems
    a schema:Intangible ;
   schema:name "Binary control systems"@en ;
    .

<http://id.worldcat.org/fast/887978> # Data structures (Computer science)
    a schema:Intangible ;
   schema:name "Data structures (Computer science)"@en ;
    .

<http://viaf.org/viaf/54241399> # Daniel Dominic Sleator
    a schema:Person ;
   schema:birthDate "1953" ;
   schema:familyName "Sleator" ;
   schema:givenName "Daniel Dominic" ;
   schema:givenName "Daniel D." ;
   schema:name "Daniel Dominic Sleator" ;
    .


Content-negotiable representations

關閉視窗

請登入WorldCat 

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