Parallel Branch-and-Bound Formulations for AND/OR Tree Search

Authors:
Vipin Kumar;Laveen N. Kanal
Affiliations:
Department of Computer Sciences, University of Texas at Austin, Austin, TX 78712.;-
Venue:
IEEE Transactions on Pattern Analysis and Machine Intelligence
Year:
1984

Citing 0
Cited 5

Performance evaluation of parallel iterative deepening A* on clusters of workstations

Performance Evaluation - Performance modelling and evaluation of high-performance parallel and distributed systems
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
Relating data-parallelism and (and-) parallelism in logic programs

Computer Languages
Work Stealing Strategies For Multi-Core Parallel Branch-and-Bound Algorithm Using Factorial Number System

Proceedings of Programming Models and Applications on Multicores and Manycores

Quantified Score

Hi-index	0.14

Visualization

Abstract

This paper discusses two general schemes for performing branch-and-bound (B&B) search in parallel. These schemes are applicable in principle to most of the problems which can be solved by B&B. The schemes are implemented for SSS*, a versatile algorithm having applications in game tree search, structural pattern analysis, and AND/OR graph search. The performance of parallel SSS* is studied in the context of AND/OR tree and game tree search. The paper concludes with comments on potential applications of these parallel implementations of SSS* in structural pattern analysis and game playing.