passa ai contenuti
Optimal binary trees in online algorithms Anteprima di questo documento
ChiudiAnteprima di questo documento
Stiamo controllando…

Optimal binary trees in online algorithms

Autore: Daniel D Sleator; M Talupur
Editore: Pittsburgh, Pa. : School of Computer Science, Carnegie Mellon University, [2002]
Serie: Research paper (Carnegie Mellon University. School of Computer Science), CMU-CS-02-148.
Edizione/Formato:   Libro : English
Banca dati:WorldCat
Sommario:
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."
Voto:

(non ancora votato) 0 con commenti - Diventa il primo.

Soggetti
Altri come questo

 

Trova una copia in biblioteca

&AllPage.SpinnerRetrieving; Stiamo ricercando le biblioteche che possiedono questo documento…

Dettagli

Tipo documento: Book
Tutti gli autori / Collaboratori: Daniel D Sleator; M Talupur
Numero OCLC: 52156499
Note: "September 2002."
Descrizione: 7 p. ; 28 cm.
Titolo della serie: Research paper (Carnegie Mellon University. School of Computer Science), CMU-CS-02-148.
Responsabilità: 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."

Commenti

Commenti degli utenti
Recuperando commenti GoodReads…
Stiamo recuperando commenti DOGObooks

Etichette

Diventa il primo.
Conferma questa richiesta

Potresti aver già richiesto questo documento. Seleziona OK se si vuole procedere comunque con questa richiesta.

Dati collegati


<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

Chiudi finestra

Per favore entra in WorldCat 

Non hai un account? Puoi facilmente crearne uno gratuito.