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.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Anbieter: PBShop.store UK, Fairford, GLOS, Vereinigtes Königreich
HRD. Zustand: New. New Book. Shipped from UK. Established seller since 2000. Artikel-Nr. FW-9780821804476
Anzahl: 2 verfügbar
Anbieter: Rarewaves.com USA, London, LONDO, Vereinigtes Königreich
Hardback. Zustand: 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. Artikel-Nr. LU-9780821804476
Anzahl: 1 verfügbar
Anbieter: Revaluation Books, Exeter, Vereinigtes Königreich
Hardcover. Zustand: Brand New. 162 pages. 10.50x7.50x0.75 inches. In Stock. Artikel-Nr. __0821804472
Anzahl: 2 verfügbar
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
Zustand: New. In English. Artikel-Nr. ria9780821804476_new
Anzahl: 2 verfügbar
Anbieter: Kennys Bookstore, Olney, MD, USA
Zustand: 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. Artikel-Nr. V9780821804476
Anzahl: 1 verfügbar
Anbieter: moluna, Greven, Deutschland
Zustand: 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 optim. Artikel-Nr. 2298428278
Anzahl: 2 verfügbar
Anbieter: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irland
Zustand: 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. . . . . Artikel-Nr. V9780821804476
Anzahl: 1 verfügbar
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Buch. Zustand: Neu. Neuware. Artikel-Nr. 9780821804476
Anzahl: 2 verfügbar
Anbieter: Rarewaves.com UK, London, Vereinigtes Königreich
Hardback. Zustand: 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. Artikel-Nr. LU-9780821804476
Anzahl: 1 verfügbar