Nicht aus der Schweiz? Besuchen Sie lehmanns.de
Für diesen Artikel ist leider kein Bild verfügbar.

Parallel Processing of Discrete Optimization Problems

Buch | Hardcover
1995
American Mathematical Society (Verlag)
978-0-8218-0240-3 (ISBN)
CHF 184,95 inkl. MwSt
  • Keine Verlagsinformationen verfügbar
  • Artikel merken
Contains papers presented at the Workshop on Parallel Processing of Discrete Optimization Problems held at DIMACS in April 1994. This book covers a wide spectrum of algorithms and applications in parallel processing of discrete optimization and related problems. It contains topics that include parallel branch and bound algorithms.
This book contains papers presented at the Workshop on Parallel Processing of Discrete Optimization Problems held at DIMACS in April 1994. The contents cover a wide spectrum of the most recent algorithms and applications in parallel processing of discrete optimization and related problems. Topics include parallel branch and bound algorithms, scalability, load balancing, parallelism and irregular data structures and scheduling task graphs on parallel machines. Applications include parallel algorithms for solving satisfiability problems, location problems, linear programming, quadratic and linear assignment problems. This book would be suitable as a textbook in advanced courses on parallel algorithms and combinatorial optimization.

Proving correctness for balancing networks by C. Busch and M. Mavronicolas A note on parallel randomized algorithms for searching problems by A. Clementi, J. Rolim, and L. Kucera Modeling parallel branch-and-bound for asynchronous implementations by R. Correa and A. Ferreira A data parallel space dilation algorithm for the concentrator location problem by O. Damberg and A. Migdalas A multistage approach for scheduling task graphs on parallel machines by A. Gerasoulis, J. Jiao, and T. Yang Parallel algorithms for satisfiability (SAT) problem by J. Gu Experiences with a parallel formulation of an interior point algorithm by G. Karypis, A. Gupta, and V. Kumar Experiences with a synchronous parallel branch and bound algorithm by P. S. Laursen New anticipatory load balancing strategies for parallel $A^/ast$ algorithms by N. R. Mahapatra and S. Dutt A parallel algorithm for computing all homomorphisms of deterministic finite automata by B. Mikolajczak Query optimization and processing in parallel databases by T. M. Niccum, J. Srivastava, B. Himatsingka, and J. Li Scheduling acyclic task graphs on distributed memory parallel architectures by S. Pande and K. Psarris Scalability of massively parallel depth-first search by A. Reinefeld On irregular data structures and asynchronous parallel branch and bound algorithms by C. Roucairol Parallel algorithms for the assignment problem--An experimental evaluation of three distributed algorithms by C. Schutt and J. Clausen Serial & parallel algorithms for QSP problems by J. M. Smith and K. Xu.

Erscheint lt. Verlag 30.7.1995
Reihe/Serie Series in Discrete Mathematics & Theoretical Computer Science
Zusatzinfo illustrations
Verlagsort Providence
Sprache englisch
Gewicht 907 g
Themenwelt Mathematik / Informatik Informatik Theorie / Studium
Mathematik / Informatik Mathematik Graphentheorie
ISBN-10 0-8218-0240-2 / 0821802402
ISBN-13 978-0-8218-0240-3 / 9780821802403
Zustand Neuware
Haben Sie eine Frage zum Produkt?
Mehr entdecken
aus dem Bereich
was jeder über Informatik wissen sollte

von Timm Eichstädt; Stefan Spieker

Buch | Softcover (2024)
Springer Vieweg (Verlag)
CHF 53,15
Grundlagen – Anwendungen – Perspektiven

von Matthias Homeister

Buch | Softcover (2022)
Springer Vieweg (Verlag)
CHF 48,95
Eine Einführung in die Systemtheorie

von Margot Berghaus

Buch | Softcover (2022)
UTB (Verlag)
CHF 34,95