80 search results - page 2 / 16 » Cube Pruning as Heuristic Search |
AAAI
2000
13 years 6 months ago
2000
Maxn (Luckhardt and Irani, 1986) is the extension of the minimax backup rule to multi-player games. We have shown that only a limited version of alpha-beta pruning, shallow prunin...
ICASSP
2010
IEEE
13 years 5 days ago
2010
IEEE
This paper proposes a method to optimize Viterbi beam search based on search error risk minimization in large vocabulary continuous speech recognition (LVCSR). Most speech recogni...
CG
2000
Springer
13 years 9 months ago
2000
Springer
: We present a new algorithm for selective search by iterative expansion of leaf nodes. The algorithm reasons with leaf evaluations in a way that leads to high confidence in the c...
AAAI
2010
13 years 2 months ago
2010
Search based solvers for Quantified Boolean Formulas (QBF) have adapted the SAT solver techniques of unit propagation and clause learning to prune falsifying assignments. The tech...
ASPDAC
2005
ACM
13 years 11 months ago
2005
ACM
- This paper extends the depth first search (DFS) used in the previously proposed witness string method for generating efficient test vectors. A state pruning method is added that ...