omitir hasta el contenido
Optimal binary trees in online algorithms Ver este material de antemano
CerrarVer este material de antemano
Chequeando…

Optimal binary trees in online algorithms

Autor: Daniel D Sleator; M Talupur
Editorial: Pittsburgh, Pa. : School of Computer Science, Carnegie Mellon University, [2002]
Serie: Research paper (Carnegie Mellon University. School of Computer Science), CMU-CS-02-148.
Edición/Formato:   Libro : Inglés (eng)
Base de datos:WorldCat
Resumen:
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."
Calificación:

(todavía no calificado) 0 con reseñas - Ser el primero.

Temas
Más materiales como éste

 

Encontrar un ejemplar en la biblioteca

&AllPage.SpinnerRetrieving; Encontrando bibliotecas que tienen este material…

Detalles

Tipo de documento: Libro/Texto
Todos autores / colaboradores: Daniel D Sleator; M Talupur
Número OCLC: 52156499
Notas: "September 2002."
Descripción: 7 p. ; 28 cm.
Título de la serie: Research paper (Carnegie Mellon University. School of Computer Science), CMU-CS-02-148.
Responsabilidad: D. Sleator and M. Talupur.

Resumen:

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

Reseñas

Reseñas contribuidas por usuarios
Recuperando reseñas de GoodReads…
Recuperando reseñas de DOGObooks…

Etiquetas

Ser el primero.
Confirmar este pedido

Ya ha pedido este material. Escoja OK si desea procesar el pedido de todos modos.

Datos enlazados


<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

Cerrar ventana

Inicie una sesión con WorldCat 

¿No tienes una cuenta? Puede fácilmente crear una cuenta gratuita.