跳到内容
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 

没有张号吗?很容易就可以 建立免费的账号.