搜索资源列表
fASR
- 以半连续隐含马尔可夫模型HMM 为例,分析了影响Viterbi算法效率的主要原因,讨论了提高该算法效率的3种实用策略,即码本剪枝、Beam剪枝及降低精度,在保证一定识别率的前提下,使得搜索处理更加有效,提高了搜索的速度-to semi-continuous HMM HMM example, Analysis of the impact on the efficiency of the Viterbi Algorithm main discussed increasing the efficien
jianzhisuanfa
- 这是博弈论算法全集第四部分:剪枝算法,其它算法将陆续推出.以便与大家共享
Intelligentbackgammonsoftwaredesign
- 智能五子棋软件设计，：胜利组合；剪枝；局面估值-Intelligent backgammon software design: Victory combination pruning situation Valuation
m7-gameII
- 此文档研究人工智能中对抗搜索，并具体讲到阿尔法和贝塔剪枝算法实现过程。-This document is the study of artificial intelligence against search, and specifically about Alfa and Berta pruning algorithm implementation process.
BlackWhite
- 一个黑白棋，使用了极大极小剪枝方法。不过由于经验不足，vc使用的并不好。但是算法没有问题-A Reversi, using the Minimax pruning methods. However, due to lack of experience, vc used is not good