Sciweavers

670 search results - page 55 / 134
» Modeling Uncertainty in Context-Aware Computing
Sort
View
AAAI
1997
13 years 11 months ago
Incremental Methods for Computing Bounds in Partially Observable Markov Decision Processes
Partially observable Markov decision processes (POMDPs) allow one to model complex dynamic decision or control problems that include both action outcome uncertainty and imperfect ...
Milos Hauskrecht
GECCO
2008
Springer
177views Optimization» more  GECCO 2008»
13 years 11 months ago
Reduced computation for evolutionary optimization in noisy environment
Evolutionary Algorithms’ (EAs’) application to real world optimization problems often involves expensive fitness function evaluation. Naturally this has a crippling effect on ...
Maumita Bhattacharya
AAAI
1996
13 years 11 months ago
Computing Optimal Policies for Partially Observable Decision Processes Using Compact Representations
: Partially-observable Markov decision processes provide a very general model for decision-theoretic planning problems, allowing the trade-offs between various courses of actions t...
Craig Boutilier, David Poole
TPDS
2010
135views more  TPDS 2010»
13 years 8 months ago
Maximizing Service Reliability in Distributed Computing Systems with Random Node Failures: Theory and Implementation
—In distributed computing systems (DCSs) where server nodes can fail permanently with nonzero probability, the system performance can be assessed by means of the service reliabil...
Jorge E. Pezoa, Sagar Dhakal, Majeed M. Hayat
INTERSPEECH
2010
13 years 4 months ago
Feature versus model based noise robustness
Over the years, the focus in noise robust speech recognition has shifted from noise robust features to model based techniques such as parallel model combination and uncertainty de...
Kris Demuynck, Xueru Zhang, Dirk Van Compernolle, ...