コンテンツへ移動
Optimal binary trees in online algorithms 資料のプレビュー
閉じる資料のプレビュー
確認中…

Optimal binary trees in online algorithms

著者: Daniel D Sleator; M Talupur
出版: Pittsburgh, Pa. : School of Computer Science, Carnegie Mellon University, [2002]
シリーズ: Research paper (Carnegie Mellon University. School of Computer Science), CMU-CS-02-148.
エディション/フォーマット:   書籍 : English
データベース:WorldCat
概要:
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."
評価:

(まだ評価がありません) 0 件のレビュー - 是非あなたから!

件名:
関連情報:

 

オフラインで入手

&AllPage.SpinnerRetrieving; この資料の所蔵館を検索中…

詳細

ドキュメントの種類: 図書
すべての著者/寄与者: Daniel D Sleator; M Talupur
OCLC No.: 52156499
注記: "September 2002."
物理形態: 7 p. ; 28 cm.
シリーズタイトル: Research paper (Carnegie Mellon University. School of Computer Science), CMU-CS-02-148.
責任者: D. Sleator and M. Talupur.

概要:

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

レビュー

ユーザーレビュー
GoodReadsのレビューを取得中…
DOGObooksのレビューを取得中…

タグ

まずはあなたから!
リクエストの確認

あなたは既にこの資料をリクエストしている可能性があります。このリクエストを続行してよろしければ、OK を選択してください。

リンクデータ


<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

ウインドウを閉じる

WorldCatにログインしてください 

アカウントをお持ちではないですか?簡単に 無料アカウントを作成することができます。.