pular para conteúdo
Optimal binary trees in online algorithms Ver prévia deste item
FecharVer prévia deste item
Checando...

Optimal binary trees in online algorithms

Autor: Daniel D Sleator; M Talupur
Editora: Pittsburgh, Pa. : School of Computer Science, Carnegie Mellon University, [2002]
Séries: Research paper (Carnegie Mellon University. School of Computer Science), CMU-CS-02-148.
Edição/Formato   Livro : Inglês
Base de Dados:WorldCat
Resumo:
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."
Classificação:

(ainda não classificado) 0 com críticas - Seja o primeiro.

Assuntos
Mais como este

 

Encontrar uma cópia na biblioteca

&AllPage.SpinnerRetrieving; Encontrando bibliotecas que possuem este item...

Detalhes

Tipo de Documento: Livro
Todos os Autores / Contribuintes: Daniel D Sleator; M Talupur
Número OCLC: 52156499
Notas: "September 2002."
Descrição: 7 p. ; 28 cm.
Título da Série: Research paper (Carnegie Mellon University. School of Computer Science), CMU-CS-02-148.
Responsabilidade: D. Sleator and M. Talupur.

Resumo:

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

Críticas

Críticas contribuídas por usuários
Recuperando críticas GoodReas...
Recuperando comentários DOGObooks

Etiquetas

Seja o primeiro.
Confirmar esta solicitação

Você já pode ter solicitado este item. Por favor, selecione Ok se gostaria de proceder com esta solicitação de qualquer forma.

Dados Ligados


<http://www.worldcat.org/oclc/52156499>
library:oclcnum"52156499"
library:placeOfPublication
library:placeOfPublication
rdf:typeschema:Book
schema:about
schema:about
<http://id.worldcat.org/fast/831860>
rdf:typeschema:Intangible
schema:name"Binary control systems"@en
schema:name"Binary control systems."@en
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

Close Window

Por favor, conecte-se ao WorldCat 

Não tem uma conta? Você pode facilmente criar uma conta gratuita.