The Dynamic Tree Expression Problem,

Abstract

We present a uniform method for obtaining efficient parallel algorithms for a rather large class of problems. The method is based on a logic programming model, and it derives its efficiency from fast parallel routines for the evaluation of expression trees.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
May 02, 1987
Accession Number
ADA323937

Entities

People

  • Ernst W. Mayr

Organizations

  • Stanford University

Tags

Communities of Interest

  • Energy and Power Technologies

DTIC Thesaurus Topics

  • Algorithms
  • Artificial Intelligence
  • Automata
  • Cells
  • Circuits
  • Coefficients
  • Computational Complexity
  • Computations
  • Computer Programming
  • Computer Science
  • Intervals
  • Iterations
  • Machines
  • Networks
  • Parallel Computing
  • Parallel Processors
  • Standards

Fields of Study

  • Computer science

Readers

  • Computational Fluid Dynamics (CFD)
  • Graph Algorithms and Convex Optimization.
  • Linear Algebra