beam search

基本解释

Beam search is a heuristic search algorithm that is an optimization of best-first search that reduces its memory requirement.
定向搜索是一种启发式搜索算法，它是对减少内存需求的最佳优先搜索的优化算法。
Considering the characteristics of its optimal solution, the author puts forward improved beam search algorithm and genetic algorithm to solve the above model.
根据模型最优解的特征，设计了求解模型的集束搜索算法和遗传算法。
In order to search for the optimizing solutions of tool switching problem effectively, a beam search based heuristic algorithm is put forward for formulating heuristic solution space of the problem.
为了有效地搜索到刀具交换问题的优化解，本文提出了基于定向搜索的启发式算法的求解方法。

束搜索
The system is based on continuous hidden Markov model. Two-pass feature extraction and beam search strategy are also employed to reduce the consumption of the RAM and enhance the recognition rate.
系统采用连续隐含马尔科夫(CHMM)算法,运用了分阶段提取特征、束搜索等策略,在保证系统识别性能的同时大大降低了内存消耗,提高了识别速度,识别率在98.5%以上,识别时间在0.5倍实时以下。
束状搜索
beam搜索
定向搜索