Network Flows and Matching: First Dimacs Implementation Challenge (Dimacs Series in Discrete Mathematics and Theoretical Computer Science)

Valutazione media 0
( su 0 valutazioni fornite da Goodreads )
 
9780821865989: Network Flows and Matching: First Dimacs Implementation Challenge (Dimacs Series in Discrete Mathematics and Theoretical Computer Science)

Interest has grown recently in the application of computational and statistical tools to problems in the analysis of algorithms. In many algorithmic domains worst-case bounds are too pessimistic and tractable probabilistic models too unrealistic to provide meaningful predictions of practical algorithmic performance. Experimental approaches can provide knowledge where purely analytical methods fail and can provide insights to motivate and guide deeper analytical results. The DIMACS Implementation Challenge was organized to encourage experimental work in the area of network flows and matchings. Participants at sites in the U.S., Europe, and Japan undertook projects between November 1990 and August 1991 to test and evaluate algorithms for these problems. The Challenge culminated in a three-day workshop held in October 1991 at DIMACS.This volume contains the revised and refereed versions of twenty-two of the papers presented at the workshop, along with supplemental material about the Challenge and the Workshop.

Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.

I migliori risultati di ricerca su AbeBooks

1.

David S. Johnson; Editor-Catherine C. McGeoch
Editore: American Mathematical Society (1993)
ISBN 10: 0821865986 ISBN 13: 9780821865989
Nuovi Rilegato Quantità: > 20
Da
Sequitur Books
(Boonsboro, MD, U.S.A.)
Valutazione libreria
[?]

Descrizione libro American Mathematical Society, 1993. Hardcover. Condizione libro: New. Brand new. We distribute directly for the publisher. Interest has grown recently in the application of computational and statistical tools to problems in the analysis of algorithms. In many algorithmic domains worst-case bounds are too pessimistic and tractable probabilistic models too unrealistic to provide meaningful predictions of practical algorithmic performance. Experimental approaches can provide knowledge where purely analytical methods fail and can provide insights to motivate and guide deeper analytical results. The DIMACS Implementation Challenge was organized to encourage experimental work in the area of network flows and matchings. Participants at sites in the U.S., Europe, and Japan undertook projects between November 1990 and August 1991 to test and evaluate algorithms for these problems. The Challenge culminated in a three-day workshop held in October 1991 at DIMACS. This volume contains the revised and refereed versions of twenty-two of the papers presented at the workshop, along with supplemental material about the Challenge and the Workshop.Co-published with the Center for Discrete Mathematics and Theoretical Computer Science beginning with Volume 8. Volumes 1-7 were co-published with the Association for Computer Machinery (ACM). Codice libro della libreria 1005100102

Maggiori informazioni su questa libreria | Fare una domanda alla libreria

Compra nuovo
EUR 87,58
Convertire valuta

Aggiungere al carrello

Spese di spedizione: EUR 3,40
In U.S.A.
Destinazione, tempi e costi

2.

David S. Johnson, Catherine C. McGeoch (Editor)
Editore: Amer Mathematical Society (1993)
ISBN 10: 0821865986 ISBN 13: 9780821865989
Nuovi Rilegato Quantità: 1
Da
Ergodebooks
(RICHMOND, TX, U.S.A.)
Valutazione libreria
[?]

Descrizione libro Amer Mathematical Society, 1993. Hardcover. Condizione libro: New. Codice libro della libreria DADAX0821865986

Maggiori informazioni su questa libreria | Fare una domanda alla libreria

Compra nuovo
EUR 119,11
Convertire valuta

Aggiungere al carrello

Spese di spedizione: EUR 3,39
In U.S.A.
Destinazione, tempi e costi