The Community for Technology Leaders
Green Image
Issue No. 06 - June (1984 vol. 6)
ISSN: 0162-8828
pp: 768-778
Vipin Kumar , Department of Computer Sciences, University of Texas at Austin, Austin, TX 78712.
Laveen N. Kanal , Department of Computer Sciences, University of Maryland, College Park, MD 20742; L. N. K. Corporation, Silver Spring, MD.
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.

L. N. Kanal and V. Kumar, "Parallel Branch-and-Bound Formulations for AND/OR Tree Search," in IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 6, no. , pp. 768-778, 1984.
384 ms
(Ver 3.3 (11022016))