Geschäftskunden Kundenprogramme

KI-Beratung Beta
Vor Ort
Merkzettel Warenkorb
  • Produktbild: Parallel Algorithms for Irregularly Structured Problems
  • Produktbild: Parallel Algorithms for Irregularly Structured Problems
Band 980

Parallel Algorithms for Irregularly Structured Problems Second International Workshop, IRREGULAR '95, Lyon, France, September 4 - 6, 1995. Proceedings

Aus der Reihe Lecture Notes in Computer Science

Fr. 72.90

inkl. gesetzl. MwSt., Versandkostenfrei

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

25.08.1995

Abbildungen

X, 418 p.

Herausgeber

Afonso Ferreira + weitere

Verlag

Springer Berlin

Seitenzahl

418

Maße (L/B/H)

23.5/15.5/2.4 cm

Gewicht

645 g

Auflage

1995

Sprache

Englisch

ISBN

978-3-540-60321-4

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

25.08.1995

Abbildungen

X, 418 p.

Herausgeber

Verlag

Springer Berlin

Seitenzahl

418

Maße (L/B/H)

23.5/15.5/2.4 cm

Gewicht

645 g

Auflage

1995

Sprache

Englisch

ISBN

978-3-540-60321-4

Herstelleradresse

Springer-Verlag KG
Sachsenplatz 4-6
1201 Wien
AT

Email: ProductSafety@springernature.com

Noch keine Bewertungen vorhanden

Verfassen Sie die erste Bewertung zu diesem Artikel

Helfen Sie anderen Kundinnen und Kunden durch Ihre Meinung.

Kundinnen und Kunden meinen

Bewertungen (0)
  • Produktbild: Parallel Algorithms for Irregularly Structured Problems
  • Produktbild: Parallel Algorithms for Irregularly Structured Problems
  • Regular versus irregular problems and algorithms.- Algorithmic skeletons for adaptive multigrid methods.- Run-time techniques for parallelizing sparse matrix problems.- Fast execution of irregularly structured programs with low communication frequency on the hypercube.- Run-time parallelization of irregular DOACROSS loops.- Instruction scheduling and global register allocation for SIMD multiprocessors.- General bounds for the assignment of irregular dependency graphs.- A new scheme for dynamic processor assignment for irregular problems.- An efficient mean field annealing formulation for mapping unstructured domains to hypercubes.- Partitioning & mapping of unstructured meshes to parallel machine topologies.- Integrating software pipelining and graph scheduling for iterative scientific computations.- Approximation algorithms for time constrained scheduling.- On the scope of applicability of the ETF algorithm.- Optimal mapping of neighbourhood-constrained systems.- Parallel processing in DNA analysis.- Solving computational fluid dynamics problems on unstructured grids with distributed parallel processing.- Parallel decomposition of unstructured FEM-meshes.- Massively parallel approximation of irregular triangular meshes with G1 parametric surfaces.- Distributed symbolic computation with DTS.- A parallel processing paradigm for irregular applications.- Load balancing strategies for a parallel system of particles.- A reconfigurable parallel algorithm for sparse Cholesky factorization.- Adapted wavelet analysis on moderate parallel distributed memory MIMD architectures.- A new parallel approach to the constrained two-dimensional cutting stock problem.- Using the ProSet-Linda prototyping language for investigating MIMD algorithms for model matching in 3-D computer vision.-Parallel search for combinatorial optimization: Genetic algorithms, simulated annealing, tabu search and GRASP.- Better algorithms for parallel backtracking.- Parallel game tree search on SIMD machines.- Asynchronous parallel branch and bound and anomalies.- Fast priority queues for parallel branch-and-bound.- A parallel formulation for general branch-and-bound algorithms.