passa ai contenuti
On-line algorithms : proceedings of a DIMACS workshop, February 11-13, 1991 Anteprima di questo documento
ChiudiAnteprima di questo documento
Stiamo controllando…

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

Autore: Lyle A McGeoch; Daniel D Sleator; DIMACS (Group)
Editore: 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.
Edizione/Formato:   Libro : EnglishVedi tutte le edizioni e i formati
Banca dati:WorldCat
Sommario:

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  Per saperne di più…

Voto:

(non ancora votato) 0 con commenti - Diventa il primo.

Soggetti
Altri come questo

 

Trova una copia in biblioteca

&AllPage.SpinnerRetrieving; Stiamo ricercando le biblioteche che possiedono questo documento…

Dettagli

Informazioni aggiuntive sul formato: Online version:
On-line algorithms.
Providence, R.I. : American Mathematical Society ; Baltimore, Md. : Association for Computing Machinery, c1992
(OCoLC)625872862
Tipo documento: Book
Tutti gli autori / Collaboratori: Lyle A McGeoch; Daniel D Sleator; DIMACS (Group)
ISBN: 082186596X 9780821865965 0897914651 9780897914659
Numero OCLC: 24953511
Note: "NSF Science and Technology Center in Discrete Mathematics and Theoretical Computer Science, a consortium of Rutgers University, Princeton University, AT & T Bell Labs, Bellcore."
Descrizione: xii, 179 p. : ill. ; 27 cm.
Contenuti: 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.
Titolo della serie: DIMACS series in discrete mathematics and theoretical computer science, v. 7.
Responsabilità: Lyle A. McGeoch, Daniel D. Sleator, editors.
Maggiori informazioni:

Commenti

Commenti degli utenti
Recuperando commenti GoodReads…
Stiamo recuperando commenti DOGObooks

Etichette

Diventa il primo.
Conferma questa richiesta

Potresti aver già richiesto questo documento. Seleziona OK se si vuole procedere comunque con questa richiesta.

Dati collegati


<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

Chiudi finestra

Per favore entra in WorldCat 

Non hai un account? Puoi facilmente crearne uno gratuito.