Encontrar uma cópia na biblioteca
Encontrando bibliotecas que possuem este item...
|Tipo de Material:||Publicação de conferência|
|Tipo de Documento:||Livro|
|Todos os Autores / Contribuintes:||
Lyle A McGeoch; Daniel Dominic Sleator
|ISBN:||082186596X 9780821865965 0897914651 9780897914659|
|Notas:||Actes de "DIMACS workshop on on-line algorithms", tenu à New Brunswick du 11 au 13 février 1991.
Bibliogr. à la fin de chaque chap.
|Descrição:||XII-179 p. : ill. ; 26 cm.|
|Conteúdos:||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.|
|Título da Série:||DIMACS series in discrete mathematics and theoretical computer science, 7|
|Responsabilidade:||Lyle A. McGeoch, Daniel D. Sleator, ed.|