Sciweavers

80 search results - page 6 / 16
» Cube Pruning as Heuristic Search
Sort
View
INTERSPEECH
2010
13 years 2 months ago
Improvements of search error risk minimization in viterbi beam search for speech recognition
This paper describes improvements in a search error risk minimization approach to fast beam search for speech recognition. In our previous work, we proposed this approach to reduc...
Takaaki Hori, Shinji Watanabe, Atsushi Nakamura
CAEPIA
2007
Springer
14 years 2 months ago
Heuristics for Planning with Action Costs
We introduce a non-admissible heuristic for planning with action costs, called the set-additive heuristic, that combines the benefits of the additive heuristic used in the HSP pla...
Emil Keyder, Hector Geffner
AI
2002
Springer
13 years 7 months ago
Improving heuristic mini-max search by supervised learning
This article surveys three techniques for enhancing heuristic game-tree search pioneered in the author's Othello program Logistello, which dominated the computer Othello scen...
Michael Buro
CP
2005
Springer
14 years 1 months ago
Search and Inference in AI Planning
While Planning has been a key area in Artificial Intelligence since its beginnings, significant changes have occurred in the last decade as a result of new ideas and a more estab...
Hector Geffner
VLSID
2003
IEEE
126views VLSI» more  VLSID 2003»
14 years 8 months ago
Comparison of Heuristic Algorithms for Variable Partitioning in Circuit Implementation
Functional decomposition is a process of splitting a complex circuit into smaller sub-circuits. This paper deals with the problem of determining the set of best free and bound var...
Muthukumar Venkatesan, Henry Selvaraj