omitir hasta el contenido
On-line algorithms : proceedings of a DIMACS workshop, February 11-13, 1991 Ver este material de antemano
CerrarVer este material de antemano
Chequeando…

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

Autor: Lyle A McGeoch; Daniel D Sleator; DIMACS (Group)
Editorial: Providence, R.I. : American Mathematical Society ; Baltimore, Md. : Association for Computing Machinery, ©1992.
Serie: DIMACS series in discrete mathematics and theoretical computer science, v. 7.
Edición/Formato:   Libro : Inglés (eng)Ver todas las ediciones y todos los formatos
Base de datos:WorldCat
Resumen:

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  Leer más

Calificación:

(todavía no calificado) 0 con reseñas - Ser el primero.

Temas
Más materiales como éste

 

Encontrar un ejemplar en la biblioteca

&AllPage.SpinnerRetrieving; Encontrando bibliotecas que tienen este material…

Detalles

Formato físico adicional: Online version:
On-line algorithms.
Providence, R.I. : American Mathematical Society ; Baltimore, Md. : Association for Computing Machinery, c1992
(OCoLC)625872862
Tipo de documento: Libro/Texto
Todos autores / colaboradores: Lyle A McGeoch; Daniel D Sleator; DIMACS (Group)
ISBN: 082186596X 9780821865965 0897914651 9780897914659
Número OCLC: 24953511
Notas: "NSF Science and Technology Center in Discrete Mathematics and Theoretical Computer Science, a consortium of Rutgers University, Princeton University, AT & T Bell Labs, Bellcore."
Descripción: xii, 179 p. : ill. ; 27 cm.
Contenido: 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 de la serie: DIMACS series in discrete mathematics and theoretical computer science, v. 7.
Responsabilidad: Lyle A. McGeoch, Daniel D. Sleator, editors.
Más información:

Reseñas

Reseñas contribuidas por usuarios
Recuperando reseñas de GoodReads…
Recuperando reseñas de DOGObooks…

Etiquetas

Ser el primero.
Confirmar este pedido

Ya ha pedido este material. Escoja OK si desea procesar el pedido de todos modos.

Datos enlazados


<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

Cerrar ventana

Inicie una sesión con WorldCat 

¿No tienes una cuenta? Puede fácilmente crear una cuenta gratuita.