zum Inhalt wechseln
Optimal binary trees in online algorithms Titelvorschau
SchließenTitelvorschau
Prüfung…

Optimal binary trees in online algorithms

Verfasser/in: Daniel D Sleator; M Talupur
Verlag: Pittsburgh, Pa. : School of Computer Science, Carnegie Mellon University, [2002]
Serien: Research paper (Carnegie Mellon University. School of Computer Science), CMU-CS-02-148.
Ausgabe/Format   Buch : Englisch
Datenbank:WorldCat
Zusammenfassung:
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."
Bewertung:

(noch nicht bewertet) 0 mit Rezensionen - Verfassen Sie als Erste eine Rezension.

Themen
Ähnliche Titel

 

Exemplar ausleihen

&AllPage.SpinnerRetrieving; Suche nach Bibliotheken, die diesen Titel besitzen ...

Details

Dokumenttyp: Buch
Alle Autoren: Daniel D Sleator; M Talupur
OCLC-Nummer: 52156499
Anmerkungen: "September 2002."
Beschreibung: 7 p. ; 28 cm.
Serientitel: Research paper (Carnegie Mellon University. School of Computer Science), CMU-CS-02-148.
Verfasserangabe: D. Sleator and M. Talupur.

Abstract:

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

Rezensionen

Nutzer-Rezensionen
Suche nach GoodReads-Rezensionen
Suche nach DOGObooks-Rezensionen…

Tags

Tragen Sie als Erste Tags ein.
Anfrage bestätigen

Sie haben diesen Titel bereits angefordert. Wenn Sie trotzdem fortfahren möchten, klicken Sie auf OK.

Verlinkung


<http://www.worldcat.org/oclc/52156499>
library:oclcnum"52156499"
library:placeOfPublication
library:placeOfPublication
rdf:typeschema:Book
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.""@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

Fenster schließen

Bitte in WorldCat einloggen 

Sie haben kein Konto? Sie können sehr einfach ein kostenloses Konto anlegen,.