This is the authors' abstract. We don't add key points for this paper.
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.
Answers are grounded in this paper and cite their sources.
No takes yet. Share an insight, caveat, or question.
Kumar et al. (1984) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: