Sciweavers

3373 search results - page 164 / 675
» Naturalistic Decision Making
Sort
View
AOR
2010
13 years 6 months ago
Speeding up Stochastic Dynamic Programming with Zero-Delay Convolution
We show how a technique from signal processing known as zero-delay convolution can be used to develop more efficient dynamic programming algorithms for a broad class of stochastic...
Brian C. Dean
INTERSPEECH
2010
13 years 4 months ago
Online adaptive learning for speech recognition decoding
We describe a new method for pruning in dynamic models based on running an adaptive filtering algorithm online during decoding to predict aspects of the scores in the near future....
Jeff Bilmes, Hui Lin
CVPR
2000
IEEE
14 years 11 months ago
Using Lexical Similarity in Handwritten Word Recognition
Recognition using only visual evidence cannot always be successful due to limitations of information and resources available during training. Considering relation among lexicon en...
Jaehwa Park, Venu Govindaraju
DAC
1999
ACM
14 years 10 months ago
Soft Scheduling in High Level Synthesis
In this paper, we establish a theoretical framework for a new concept of scheduling called soft scheduling. In contrasts to the traditional schedulers referred as hard schedulers,...
Jianwen Zhu, Daniel Gajski
EMO
2009
Springer
174views Optimization» more  EMO 2009»
14 years 3 months ago
Constraint Programming
To model combinatorial decision problems involving uncertainty and probability, we introduce stochastic constraint programming. Stochastic constraint programs contain both decision...
Pascal Van Hentenryck