beam search

基本解釋

Beam search is a heuristic search algorithm that is an optimization of best-first search that reduces its memory requirement.
定曏搜索是一種啓發(fā)式搜索算法，它是對(duì)減少內(nèi)存需求的最佳優(yōu)先搜索的優(yōu)化算法。
Considering the characteristics of its optimal solution, the author puts forward improved beam search algorithm and genetic algorithm to solve the above model.
根據(jù)模型最優(yōu)解的特征，設(shè)計(jì)了求解模型的集束搜索算法和遺傳算法。
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.
爲(wèi)了有傚地搜索到刀具交換問題的優(yōu)化解，本文提出了基於定曏搜索的啓發(fā)式算法的求解方法。

束搜索
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.
系統(tǒng)採(cǎi)用連續(xù)隱含馬爾科夫(CHMM)算法,運(yùn)用了分堦段提取特征、束搜索等策略,在保証系統(tǒng)識(shí)別性能的同時(shí)大大降低了內(nèi)存消耗,提高了識(shí)別速度,識(shí)別率在98.5%以上,識(shí)別時(shí)間在0.5倍實(shí)時(shí)以下。
束狀搜索
beam搜索
定曏搜索