コンテンツへ移動
On-line algorithms : proceedings of a DIMACS workshop, February 11-13, 1991 資料のプレビュー
閉じる資料のプレビュー
確認中…

On-line algorithms : proceedings of a DIMACS workshop, February 11-13, 1991

著者: Lyle A McGeoch; Daniel D Sleator; DIMACS (Group)
出版: Providence, R.I. : American Mathematical Society ; Baltimore, Md. : Association for Computing Machinery, ©1992.
シリーズ: DIMACS series in discrete mathematics and theoretical computer science, v. 7.
エディション/フォーマット:   書籍 : Englishすべてのエディションとフォーマットを見る
データベース:WorldCat
概要:

Contains the proceedings of the Workshop on On-line Algorithms held at the DIMACS Center at Rutgers University in February 1991. This work examines the ways in which randomization can be used to  続きを読む

評価:

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

件名:
関連情報:

 

オフラインで入手

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

詳細

その他のフォーマット: Online version:
On-line algorithms.
Providence, R.I. : American Mathematical Society ; Baltimore, Md. : Association for Computing Machinery, c1992
(OCoLC)625872862
ドキュメントの種類: 図書
すべての著者/寄与者: Lyle A McGeoch; Daniel D Sleator; DIMACS (Group)
ISBN: 082186596X 9780821865965 0897914651 9780897914659
OCLC No.: 24953511
注記: "NSF Science and Technology Center in Discrete Mathematics and Theoretical Computer Science, a consortium of Rutgers University, Princeton University, AT & T Bell Labs, Bellcore."
物理形態: xii, 179 p. : ill. ; 27 cm.
コンテンツ: A graph-theoretic game and its application to the $k$-server problem (extended abstract) by N. Alon, R. M. Karp, D. Peleg, and D. West The server problem and on-line games by M. Chrobak and L. L. Larmore The harmonic online $K$-server algorithm is competitive by E. F. Grove The $K$-server dual and loose competitiveness for paging by N. Young A statistical adversary for on-line algorithms by P. Raghavan On-line graph coloring by H. A. Kierstead and W. T. Trotter Online weighted matching by B. Kalyanasundaram and K. Pruhs On the competitiveness of splay trees: Relations to the union-find problem by J. M. Lucas Competitive group testing by D. Z. Du and F. K. Hwang Randomized algorithms for multiprocessor page migration by J. Westbrook Navigating in unfamiliar geometric terrain (extended summary) by A. Blum, P. Raghavan, and B. Schieber Visual searching and mapping by B. Kalyanasundaram and K. Pruhs Scheduling parallel machines on-line by D. B. Shmoys, J. Wein, and D. P. Williamson Competitive paging with locality of reference (brief summary) by A. Borodin, S. Irani, P. Raghavan, and B. Schieber Lower bounds for on-line graph coloring by M. M. Halldorsson and M. Szegedy.
シリーズタイトル: DIMACS series in discrete mathematics and theoretical computer science, v. 7.
責任者: Lyle A. McGeoch, Daniel D. Sleator, editors.
その他の情報:

レビュー

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

タグ

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

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

リンクデータ


<http://www.worldcat.org/oclc/24953511>
library:oclcnum"24953511"
library:placeOfPublication
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/24953511>
rdf:typeschema:Book
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:contributor
schema:contributor
schema:contributor
schema:copyrightYear"1992"
schema:datePublished"1992"
schema:exampleOfWork<http://worldcat.org/entity/work/id/866310574>
schema:inLanguage"en"
schema:name"On-line algorithms : proceedings of a DIMACS workshop, February 11-13, 1991"@en
schema:numberOfPages"179"
schema:publisher
schema:publisher
schema:url
schema:workExample
schema:workExample

Content-negotiable representations

ウインドウを閉じる

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

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