Welcome to our book review site go-pdf.online!

You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.

Sign up

Vector Models for Data-parallel Computing
  • Language: en
  • Pages: 288

Vector Models for Data-parallel Computing

Mathematics of Computing -- Parallelism.

Introduction to Algorithms, fourth edition
  • Language: en
  • Pages: 1313

Introduction to Algorithms, fourth edition

  • Type: Book
  • -
  • Published: 2022-04-05
  • -
  • Publisher: MIT Press

A comprehensive update of the leading algorithms text, with new material on matchings in bipartite graphs, online algorithms, machine learning, and other topics. Some books on algorithms are rigorous but incomplete; others cover masses of material but lack rigor. Introduction to Algorithms uniquely combines rigor and comprehensiveness. It covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers, with self-contained chapters and algorithms in pseudocode. Since the publication of the first edition, Introduction to Algorithms has become the leading algorithms text in universities worldwide as well as the standard reference for professi...

Scientific Computing with Multicore and Accelerators
  • Language: en
  • Pages: 495

Scientific Computing with Multicore and Accelerators

  • Type: Book
  • -
  • Published: 2010-12-07
  • -
  • Publisher: CRC Press

The hybrid/heterogeneous nature of future microprocessors and large high-performance computing systems will result in a reliance on two major types of components: multicore/manycore central processing units and special purpose hardware/massively parallel accelerators. While these technologies have numerous benefits, they also pose substantial perfo

Parallel Algorithms
  • Language: en
  • Pages: 176

Parallel Algorithms

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.

Parallel Processing of Discrete Optimization Problems
  • Language: en
  • Pages: 390

Parallel Processing of Discrete Optimization Problems

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.

DNA Based Computers
  • Language: en
  • Pages: 233

DNA Based Computers

This volume presents the proceedings of a conference held at Princeton University in April 1995 as part of the DIMACS Special Year on Mathematical Support for Molecular Biology. The subject of the conference was the new area of DNA based computing. DNA based computing is the study of using DNA strands as individual computers. The concept was initiated by Leonard Adleman's paper in Science in November 1994.

Geometric and Computational Perspectives on Infinite Groups
  • Language: en
  • Pages: 240

Geometric and Computational Perspectives on Infinite Groups

This book contains the proceedings of two workshops on computational aspects of geometric group theory.

Global Minimization of Nonconvex Energy Functions: Molecular Conformation and Protein Folding
  • Language: en
  • Pages: 287

Global Minimization of Nonconvex Energy Functions: Molecular Conformation and Protein Folding

This work contains refereed papers presented at an interdisciplinary scientific meeting attended by a mix of leading biochemists and computer scientists held at DIMACS in March 1995. It describes the development of a variety of new methods which are being developed for attacking the important problem of molecular structure. It is intended for graduate students and researchers in numerical analysis, molecular biology, biochemistry, computer science, engineering, and operations.

Discrete Mathematical Problems with Medical Applications
  • Language: en
  • Pages: 246

Discrete Mathematical Problems with Medical Applications

This volume presents selected papers from a three-day workshop held during the DIMACS special years on Mathematical Support for Molecular Biology. Participants from the world over attended, giving the workshop an important international component. The study of discrete mathematics and optimization with medical applications is emerging as an important new research area. Significant applications have been found in medical research, for example in radiosurgical treatment planning, virtual endoscopy, and more. This volume presents a substantive cross-section of active research topics ranging from medical imaging to human anatomy modeling, from gamma knife treatment planning to radiation therapy, and from epileptic seizures to DNA screening. This book is an up-to-date resource reflecting current research directions.

Data Structures, Near Neighbor Searches, and Methodology: Fifth and Sixth DIMACS Implementation Challenges
  • Language: en
  • Pages: 272

Data Structures, Near Neighbor Searches, and Methodology: Fifth and Sixth DIMACS Implementation Challenges

The 11 papers are from two workshops: one in 1995-95 on dictionaries and priority queues, and the other in 1998-99 on near neighbor searches, the fifth and sixth DIMACS Algorithm Implementation Challenges initiated in 1991. They address those challenges with considerations of a practical perfect hashing algorithm, locally lifting the curse of dimensionality for a nearest neighbor search, and other topics. They also discuss methodology for the experimental analysis of algorithms. They are not indexed. Annotation copyrighted by Book News, Inc., Portland, OR.