doorgaan naar inhoud
Optimal binary trees in online algorithms Voorbeeldweergave van dit item
SluitenVoorbeeldweergave van dit item
Bezig met controle...

Optimal binary trees in online algorithms

Auteur: Daniel D Sleator; M Talupur
Uitgever: Pittsburgh, Pa. : School of Computer Science, Carnegie Mellon University, [2002]
Serie: Research paper (Carnegie Mellon University. School of Computer Science), CMU-CS-02-148.
Editie/Formaat:   Boek : Engels
Database:WorldCat
Samenvatting:
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."
Beoordeling:

(nog niet beoordeeld) 0 met beoordelingen - U bent de eerste

Onderwerpen
Meer in deze trant

 

Zoeken naar een in de bibliotheek beschikbaar exemplaar

&AllPage.SpinnerRetrieving; Bibliotheken met dit item worden gezocht…

Details

Soort document: Boek
Alle auteurs / medewerkers: Daniel D Sleator; M Talupur
OCLC-nummer: 52156499
Opmerkingen: "September 2002."
Beschrijving: 7 p. ; 28 cm.
Serietitel: Research paper (Carnegie Mellon University. School of Computer Science), CMU-CS-02-148.
Verantwoordelijkheid: D. Sleator and M. Talupur.

Fragment:

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."

Beoordelingen

Beoordelingen door gebruikers
Beoordelingen van GoodReads worden opgehaald...
Bezig met opvragen DOGObooks-reviews...

Tags

U bent de eerste.
Bevestig deze aanvraag

Misschien heeft u dit item reeds aangevraagd. Selecteer a.u.b. Ok als u toch wilt doorgaan met deze aanvraag.

Gekoppelde data


<http://www.worldcat.org/oclc/52156499>
library:oclcnum"52156499"
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/52156499>
rdf:typeschema:Book
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
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.""
schema:exampleOfWork<http://worldcat.org/entity/work/id/9136071>
schema:inLanguage"en"
schema:name"Optimal binary trees in online algorithms"
schema:numberOfPages"7"
schema:publisher
schema:url

Content-negotiable representations

Venster sluiten

Meld u aan bij WorldCat 

Heeft u geen account? U kunt eenvoudig een nieuwe gratis account aanmaken.