The Use of Parallelism to Implement a Heuristic Search.

Abstract

The role of parallel processing in heuristic search is examined by means of an example (cryptarithmetic addition). A problem solver is constructed that combines the metaphors of constraint propagation and hypothesize-and-test. The system is capable of working on many incompatible hypotheses at one time. Furthermore, it is capable of allocating different amounts of processing power to running activities and changing these allocations as computation proceeds. It is empirically found that the parallel algorithm is, on the average more efficient than a corresponding sequential one. Implications of this for problem solving in general are discussed. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Mar 01, 1981
Accession Number
ADA099184

Entities

People

  • William A. Kornfeld

Organizations

  • Massachusetts Institute of Technology

Tags

Communities of Interest

  • Energy and Power Technologies

DTIC Thesaurus Topics

  • Algorithms
  • Computations
  • Computer Programming
  • Efficiency
  • High Level Language Architecture
  • Information Systems
  • Language
  • Load Monitoring
  • Money
  • Monitoring
  • Multithreading

Fields of Study

  • Computer science

Readers

  • Artificial Intelligence
  • Operations Research
  • Parallel and Distributed Computing.