Parallel Algorithms: Third Dimacs Implementation Challenge : October 17-19, 1994 (Contemporary Mathematics)

Dimacs (Group), Challenge Workshop (1991 Dimacs)

ISBN 10: 0821804472 / ISBN 13: 9780821804476

Verlag: Amer Mathematical Society, 1997

Beschreibung

Like New.

Bestandsnummer des Verkäufers ERICA75408218044725

Bibliografische Details

• Titel: Parallel Algorithms: Third Dimacs Implementation Challenge : October 17-19, 1994 (Contemporary Mathematics)
• Verlag: Amer Mathematical Society
• Erscheinungsjahr: 1997
• Sprache: Englisch
• ISBN-10: 0821804472
• ISBN-13: 9780821804476
• Einband: Hardcover
• Zustand: Like New
• Buchtyp: book

Über diesen Titel

Inhaltsangabe

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.

Reseña del editor

This volume is the result of the Third DIMACS Implementation Challenge that was conducted as part of the 1993-94 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 speed-ups on parallel computers. The challenge invluded 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 US 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.