Related Experiment Video
Updated: May 23, 2026

Automatic Identification of Dendritic Branches and their Orientation
Published on: September 17, 2021
Parallel Branch-and-Bound Formulations for AND/OR Tree Search
1Department of Computer Sciences, University of Texas at Austin, Austin, TX 78712.
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.
Related Concept Videos
Survival Tree
Building a Survival Tree
Constructing a survival tree begins...
Statically Indeterminate Problem Solving
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
Theorems of Pappus and Guldinus: Problem Solving
Method of Joints: Problem Solving II
Method of Sections: Problem Solving II