This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Parallel Branch-and-Bound Formulations for AND/OR Tree Search
June 1984 (vol. 6 no. 6)
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.
Citation:
Vipin Kumar, Laveen N. Kanal, "Parallel Branch-and-Bound Formulations for AND/OR Tree Search," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 6, no. 6, pp. 768-778, June 1984, doi:10.1109/TPAMI.1984.4767600
Usage of this product signifies your acceptance of the Terms of Use.