A volume resulting from the Third DIMACS Implementation Challenge, conducted as part of the 1993-1994 Special Year on Parallel Algorithms held at DIMACS in October 1994. The nine contributions cover topics ranging from connected components on distributed memory machines and finding friends-of-friends clusters quickly to the Socrates massively parallel chess program. Lacks an index. Annotation c. by Book News, Inc., Portland, Or.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Book by Dimacs Group Challenge Workshop 1991 Dimacs
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
Da: PBShop.store UK, Fairford, GLOS, Regno Unito
HRD. Condizione: New. New Book. Shipped from UK. Established seller since 2000. Codice articolo FW-9780821804476
Quantità: 2 disponibili
Da: Rarewaves.com USA, London, LONDO, Regno Unito
Hardback. Condizione: New. This volume is the result of the Third DIMACS Implementation Challenge that was conducted as part of the 1993-1994 Special Year on Parallel Algorithms. The Implementation Challenge was formulated in order to provide a forum for a concerted effort to study effective algorithms for combinatorial problems and to investigate opportunities for massive speedups on parallel computers. The challenge included two problem areas for research study: tree searching algorithms, used in game search and combinatorial optimization, for example, and algorithms for sparse graphs. Participants at sites in the U.S. and Europe undertook projects from November 1993 through October 1994. The workshop was held at DIMACS in November 1994. Participants were encouraged to share test results, to rework their implementations considering feedback at the workshop, and to submit a final report for the proceedings. Nine papers were selected for this volume. Codice articolo LU-9780821804476
Quantità: 1 disponibili
Da: Revaluation Books, Exeter, Regno Unito
Hardcover. Condizione: Brand New. 162 pages. 10.50x7.50x0.75 inches. In Stock. Codice articolo __0821804472
Quantità: 2 disponibili
Da: THE SAINT BOOKSTORE, Southport, Regno Unito
Hardback. Condizione: New. New copy - Usually dispatched within 4 working days. Codice articolo B9780821804476
Quantità: 2 disponibili
Da: Kennys Bookstore, Olney, MD, U.S.A.
Condizione: New. Covers the Third DIMACS Implementation Challenge that was conducted as part of the 1993-1994 Special Year on Parallel Algorithms. This book includes two problem areas for research study: tree searching algorithms, used in game search and combinatorial optimization, for example, and algorithms for sparse graphs. Editor(s): Bhatt, Sandeep N. Series: Series in Discrete Mathematics & Theoretical Computer Science. Num Pages: 162 pages. BIC Classification: PBWH; UYA; UYFP. Category: (P) Professional & Vocational. Dimension: 267 x 190. Weight in Grams: 532. . 1997. hardcover. . . . . Books ship from the US and Ireland. Codice articolo V9780821804476
Quantità: 1 disponibili
Da: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlanda
Condizione: New. Covers the Third DIMACS Implementation Challenge that was conducted as part of the 1993-1994 Special Year on Parallel Algorithms. This book includes two problem areas for research study: tree searching algorithms, used in game search and combinatorial optimization, for example, and algorithms for sparse graphs. Editor(s): Bhatt, Sandeep N. Series: Series in Discrete Mathematics & Theoretical Computer Science. Num Pages: 162 pages. BIC Classification: PBWH; UYA; UYFP. Category: (P) Professional & Vocational. Dimension: 267 x 190. Weight in Grams: 532. . 1997. hardcover. . . . . Codice articolo V9780821804476
Quantità: 1 disponibili
Da: Rarewaves.com UK, London, Regno Unito
Hardback. Condizione: New. This volume is the result of the Third DIMACS Implementation Challenge that was conducted as part of the 1993-1994 Special Year on Parallel Algorithms. The Implementation Challenge was formulated in order to provide a forum for a concerted effort to study effective algorithms for combinatorial problems and to investigate opportunities for massive speedups on parallel computers. The challenge included two problem areas for research study: tree searching algorithms, used in game search and combinatorial optimization, for example, and algorithms for sparse graphs. Participants at sites in the U.S. and Europe undertook projects from November 1993 through October 1994. The workshop was held at DIMACS in November 1994. Participants were encouraged to share test results, to rework their implementations considering feedback at the workshop, and to submit a final report for the proceedings. Nine papers were selected for this volume. Codice articolo LU-9780821804476
Quantità: 1 disponibili