The Hearsay-II Speech-Understanding System: Integrating Knowledge to Resolve Uncertainty
ACM Computing Surveys (CSUR)
The Definition and Implementation of a Computer Programming Language Based on Constraints
The Definition and Implementation of a Computer Programming Language Based on Constraints
Human Problem Solving
A parallel implementation of iterative-deepening-A
AAAI'87 Proceedings of the sixth National conference on Artificial intelligence - Volume 1
A parallel implementation of iterative-deepening-A
AAAI'87 Proceedings of the sixth National conference on Artificial intelligence - Volume 1
Solving the really hard problems with cooperative search
AAAI'93 Proceedings of the eleventh national conference on Artificial intelligence
Hi-index | 0.00 |
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. Implication* of this for problem solving in general are discussed.