pular para conteúdo
On-line algorithms : proceedings of a DIMACS workshop, February 11-13, 1991 Ver prévia deste item
FecharVer prévia deste item
Checando...

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

Autor: Lyle A McGeoch; Daniel Dominic Sleator
Editora: Providence : American mathematical Society ; Baltimore : Maryland, cop. 1992.
Séries: DIMACS series in discrete mathematics and theoretical computer science, 7
Edição/Formato   Imprimir livro : Publicação de conferência : InglêsVer todas as edições e formatos
Base de Dados:WorldCat
Resumo:

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  Ler mais...

Classificação:

(ainda não classificado) 0 com críticas - Seja o primeiro.

Assuntos
Mais como este

 

Encontrar uma cópia na biblioteca

&AllPage.SpinnerRetrieving; Encontrando bibliotecas que possuem este item...

Detalhes

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
Número OCLC: 468016105
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.
Mais informações

Críticas

Críticas contribuídas por usuários
Recuperando críticas GoodReas...
Recuperando comentários DOGObooks

Etiquetas

Seja o primeiro.
Confirmar esta solicitação

Você já pode ter solicitado este item. Por favor, selecione Ok se gostaria de proceder com esta solicitação de qualquer forma.

Dados Ligados


Primary Entity

<http://www.worldcat.org/oclc/468016105> # On-line algorithms : proceedings of a DIMACS workshop, February 11-13, 1991
    a schema:CreativeWork, schema:Book ;
   library:oclcnum "468016105" ;
   library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/866310574#Place/providence> ; # Providence
   library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/866310574#Place/baltimore> ; # Baltimore
   library:placeOfPublication <http://id.loc.gov/vocabulary/countries/riu> ;
   schema:about <http://experiment.worldcat.org/entity/work/data/866310574#Topic/traitement_en_ligne> ; # Traitement en ligne
   schema:about <http://experiment.worldcat.org/entity/work/data/866310574#Topic/algorithme> ; # Algorithme
   schema:about <http://experiment.worldcat.org/entity/work/data/866310574#Topic/algorithmes_congres> ; # Algorithmes--Congrès
   schema:about <http://dewey.info/class/511.8/e22/> ;
   schema:author <http://experiment.worldcat.org/entity/work/data/866310574#Meeting/dimacs_workshop_on_on_line_algorithms_1991_new_brunswick_n_j> ; # DIMACS Workshop on On-line Algorithms (1991 : New Brunswick, N.J.)
   schema:bookFormat bgn:PrintBook ;
   schema:copyrightYear "op." ;
   schema:datePublished "1992" ;
   schema:editor <http://experiment.worldcat.org/entity/work/data/866310574#Person/sleator_daniel_dominic> ; # Daniel Dominic Sleator
   schema:editor <http://viaf.org/viaf/112436873> ; # Lyle A. McGeoch
   schema:exampleOfWork <http://worldcat.org/entity/work/id/866310574> ;
   schema:genre "Conference publication"@en ;
   schema:inLanguage "en" ;
   schema:isPartOf <http://experiment.worldcat.org/entity/work/data/866310574#Series/dimacs_series_in_discrete_mathematics_and_theoretical_computer_science> ; # DIMACS series in discrete mathematics and theoretical computer science ;
   schema:name "On-line algorithms : proceedings of a DIMACS workshop, February 11-13, 1991" ;
   schema:productID "468016105" ;
   schema:publication <http://www.worldcat.org/title/-/oclc/468016105#PublicationEvent/providence_american_mathematical_society_baltimore_maryland_cop_1992> ;
   schema:publisher <http://experiment.worldcat.org/entity/work/data/866310574#Agent/maryland> ; # Maryland
   schema:publisher <http://experiment.worldcat.org/entity/work/data/866310574#Agent/american_mathematical_society> ; # American mathematical Society
   schema:workExample <http://worldcat.org/isbn/9780821865965> ;
   schema:workExample <http://worldcat.org/isbn/9780897914659> ;
   wdrs:describedby <http://www.worldcat.org/title/-/oclc/468016105> ;
    .


Related Entities

<http://experiment.worldcat.org/entity/work/data/866310574#Agent/american_mathematical_society> # American mathematical Society
    a bgn:Agent ;
   schema:name "American mathematical Society" ;
    .

<http://experiment.worldcat.org/entity/work/data/866310574#Meeting/dimacs_workshop_on_on_line_algorithms_1991_new_brunswick_n_j> # DIMACS Workshop on On-line Algorithms (1991 : New Brunswick, N.J.)
    a bgn:Meeting, schema:Event ;
   schema:location <http://experiment.worldcat.org/entity/work/data/866310574#Place/new_brunswick_n_j> ; # New Brunswick, N.J.)
   schema:name "DIMACS Workshop on On-line Algorithms (1991 : New Brunswick, N.J.)" ;
    .

<http://experiment.worldcat.org/entity/work/data/866310574#Person/sleator_daniel_dominic> # Daniel Dominic Sleator
    a schema:Person ;
   schema:familyName "Sleator" ;
   schema:givenName "Daniel Dominic" ;
   schema:name "Daniel Dominic Sleator" ;
    .

<http://experiment.worldcat.org/entity/work/data/866310574#Place/new_brunswick_n_j> # New Brunswick, N.J.)
    a schema:Place ;
   schema:name "New Brunswick, N.J.)" ;
    .

<http://experiment.worldcat.org/entity/work/data/866310574#Series/dimacs_series_in_discrete_mathematics_and_theoretical_computer_science> # DIMACS series in discrete mathematics and theoretical computer science ;
    a bgn:PublicationSeries ;
   schema:hasPart <http://www.worldcat.org/oclc/468016105> ; # On-line algorithms : proceedings of a DIMACS workshop, February 11-13, 1991
   schema:name "DIMACS series in discrete mathematics and theoretical computer science ;" ;
    .

<http://experiment.worldcat.org/entity/work/data/866310574#Topic/algorithmes_congres> # Algorithmes--Congrès
    a schema:Intangible ;
   schema:name "Algorithmes--Congrès" ;
    .

<http://experiment.worldcat.org/entity/work/data/866310574#Topic/traitement_en_ligne> # Traitement en ligne
    a schema:Intangible ;
   schema:name "Traitement en ligne" ;
    .

<http://viaf.org/viaf/112436873> # Lyle A. McGeoch
    a schema:Person ;
   schema:familyName "McGeoch" ;
   schema:givenName "Lyle A." ;
   schema:name "Lyle A. McGeoch" ;
    .

<http://worldcat.org/isbn/9780821865965>
    a schema:ProductModel ;
   schema:isbn "082186596X" ;
   schema:isbn "9780821865965" ;
    .

<http://worldcat.org/isbn/9780897914659>
    a schema:ProductModel ;
   schema:isbn "0897914651" ;
   schema:isbn "9780897914659" ;
    .


Content-negotiable representations

Fechar Janela

Por favor, conecte-se ao WorldCat 

Não tem uma conta? Você pode facilmente criar uma conta gratuita.