151 search results - page 18 / 31 » Hidden Markov Decision Trees |
111
click to vote
CVPR
2005
IEEE
15 years 5 months ago
2005
IEEE
Advances in computer processing power and emerging algorithms are allowing new ways of envisioning Human Computer Interaction. This paper focuses on the development of a computing...
NIPS
2004
15 years 1 months ago
2004
Coreference analysis, also known as record linkage or identity uncertainty, is a difficult and important problem in natural language processing, databases, citation matching and m...
PERCOM
2007
ACM
15 years 11 months ago
2007
ACM
We consider sensor scheduling as the optimal observability problem for partially observable Markov decision processes (POMDP). This model fits to the cases where a Markov process ...
114
click to vote
NIPS
2007
15 years 1 months ago
2007
Bayesian Reinforcement Learning has generated substantial interest recently, as it provides an elegant solution to the exploration-exploitation trade-off in reinforcement learning...
108
click to vote
ICTAI
2010
IEEE
14 years 9 months ago
2010
IEEE
Abstract--The difficulties encountered in sequential decisionmaking problems under uncertainty are often linked to the large size of the state space. Exploiting the structure of th...