Search research articles

ABOUT JoVE

Overview Leadership Blog JoVE Help Center

AUTHORS

Publishing Process Editorial Board Scope & Policies Peer Review FAQ Submit

LIBRARIANS

Testimonials Subscriptions Access Resources Library Advisory Board FAQ

RESEARCH

JoVE Journal Methods Collections JoVE Encyclopedia of Experiments Archive

EDUCATION

JoVE Core JoVE Business JoVE Science Education JoVE Lab Manual Faculty Resource Center Faculty Site

Terms & Conditions of Use

Related Concept Videos

Survival Tree

Survival Tree

Survival trees are a non-parametric method used in survival analysis to model the relationship between a set of covariates and the time until an event of interest occurs, often referred to as the "time-to-event" or "survival time." This method is particularly useful when dealing with censored data, where the event has not occurred for some individuals by the end of the study period, or when the exact time of the event is unknown.
Building a Survival Tree
Constructing a survival tree begins...

Statically Indeterminate Problem Solving

Statically Indeterminate Problem Solving

Statically indeterminate problems are those where statics alone can not determine the internal forces or reactions. Consider a structure comprising two cylindrical rods made of steel and brass. These rods are joined at point B and restrained by rigid supports at points A and C. Now, the reactions at points A and C and the deflection at point B are to be determined. This rod structure is classified as statically indeterminate as the structure has more supports than are necessary for maintaining...

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

Mechanistic models play a crucial role in algorithms for numerical problem-solving, particularly in nonlinear mixed effects modeling (NMEM). These models aim to minimize specific objective functions by evaluating various parameter estimates, leading to the development of systematic algorithms. In some cases, linearization techniques approximate the model using linear equations.
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...

Theorems of Pappus and Guldinus: Problem Solving

Theorems of Pappus and Guldinus: Problem Solving

Pappus and Guldinus's theorems are powerful mathematical principles that are used for finding the surface area and volume of composite shapes. For example, consider a cylindrical storage tank with a conical top. Finding the surface area or volume can be challenging for such complex shapes. These theorems are particularly useful in calculating the volume and surface area of such systems. Here, the cylindrical storage tank with a conical top can be broken down into two simple shapes: a cylinder...

Method of Joints: Problem Solving II

Method of Joints: Problem Solving II

Consider a truss structure with frictionless joints fixed to a wall and roller support. If a force of 150 N is applied to joint A, the forces in each member of the truss can be determined using the method of joints.

Method of Sections: Problem Solving II

Method of Sections: Problem Solving II

Consider an arbitrary truss structure composed of diagonal, vertical, and horizontal members fixed to the wall. To calculate the force acting on members CB, GB, and GH, method of sections can be used. The loads and lengths of the horizontal and vertical members are known parameters, as shown in the figure.

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by

Same author

Problem-solving models and search strategies for pattern recognition.

IEEE transactions on pattern analysis and machine intelligence·2011

Same author

Problem reduction representation for the linguistic analysis of waveforms.

IEEE transactions on pattern analysis and machine intelligence·2011

Same author

Activation of B lymphocytes by NK cells.

International immunology·1992

Same author

Cardiac amyloidosis: hemodynamic, echocardiographic and endomyocardial biopsy studies.

Indian heart journal·1992

Same author

Serologic markers of gluten-sensitive enteropathy in bullous diseases.

Archives of dermatology·1992

Same author

Circadian nature of the photoperiodic clock in Japanese quail.

Journal of comparative physiology. A, Sensory, neural, and behavioral physiology·1992

Search research articles

Related Experiment Video

Updated: May 23, 2026

Automatic Identification of Dendritic Branches and their Orientation

Automatic Identification of Dendritic Branches and their Orientation

Published on: September 17, 2021

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

V Kumar¹, L N Kanal

¹Department of Computer Sciences, University of Texas at Austin, Austin, TX 78712.

IEEE Transactions on Pattern Analysis and Machine Intelligence

|April 14, 2012

Summary

This study presents two parallel schemes for branch-and-bound (B&B) search, implemented for the SSS* algorithm. These methods enhance performance in game tree and AND/OR graph searches.

Related Experiment Videos

Last Updated: May 23, 2026

Automatic Identification of Dendritic Branches and their Orientation

Automatic Identification of Dendritic Branches and their Orientation

Published on: September 17, 2021

Area of Science:

Computer Science
Artificial Intelligence
Algorithm Analysis

Background:

Branch-and-bound (B&B) search is a fundamental technique for solving complex optimization and search problems.
Parallel computing offers potential for significant speedups in computationally intensive algorithms like B&B.
The SSS* algorithm is a versatile search method applicable to various domains, including game trees and pattern analysis.

Purpose of the Study:

To introduce and evaluate two general schemes for parallelizing branch-and-bound search.
To implement and test these parallel schemes using the SSS* algorithm.
To analyze the performance of parallel SSS* in the context of AND/OR tree and game tree search.

Main Methods:

Development of two distinct parallelization strategies for branch-and-bound algorithms.
Implementation of these strategies within the SSS* search algorithm.
Empirical performance evaluation on AND/OR tree and game tree search problems.

Main Results:

Demonstration of the feasibility and effectiveness of the proposed parallel B&B schemes.
Quantification of performance improvements achieved by parallel SSS* on specific search tasks.
Identification of the advantages of parallel SSS* for complex search applications.

Conclusions:

The presented parallel schemes provide an effective approach to accelerate branch-and-bound search.
Parallel SSS* shows promise for applications in structural pattern analysis and artificial intelligence game playing.
Further research can explore broader applications and optimizations of parallel B&B algorithms.