跳至内容
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.
版本/格式:   圖書 : 英語所有版本和格式的總覽
資料庫: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系統控制編碼: 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的評論

標籤

成爲第一個
確認申請

你可能已經申請過這份資料。若還是想申請,請選確認。

連結資料


<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 

没有帳號嗎?你可很容易的 建立免費的帳號.