beam search


Also found in: Wikipedia.

beam search

An optimisation of the best first search graph search algorithm where only a predetermined number of paths are kept as candidates. The number of paths is the "width of the beam". If more paths than this are generated, the worst paths are discarded. This reduces the space requirements of best first search.
Mentioned in ?
References in periodicals archive ?
Tenders are invited for Set beam search light , qty-50 nos
The algorithms studied are exhaustive search algorithm, bounded search algorithm, beam search algorithm, nearest neighbor algorithm, insertion algorithm, exchange algorithm, and genetic algorithm.
The comparison results show that the Stochastics Beam Search algorithm finds the highest power point in all shading conditions with high speed and accurcy.
In this work, Stochastics Beam Search (SBS) , Simulated Annealing (SA), Fractional Open Circuit Voltage (FOCV), and Stochastic Hill Climbing (SHC) algorithms have been compared.
The Stochastic Beam Search (SBS) algorithm first entered the literature as local beam search [16].
A contribution from Romania structures web meta-search results according to the specific interests of users, and Brazilian researchers add a beam search to a decision tree induction algorithm.
For instance, to find solution in an efficient way, tabu search and beam search utilize a search strategy.
Limited Tenders are invited for Procurement Of High Beam Search Lights
For example, to find solution in the fast way, tabu search and beam search use a search strategy.