656 search results - page 108 / 132 » Complexity of finite-horizon Markov decision process problem... |
100
Voted
ICGI
2010
Springer
15 years 11 days ago
2010
Springer
In this paper we extend the PAC learning algorithm due to Clark and Thollard for learning distributions generated by PDFA to automata whose transitions may take varying time length...
101
click to vote
BTW
2009
Springer
15 years 5 months ago
2009
Springer
: Today, decision making by users of front office applications happens without analytical information supporting this process. We propose as solution Embedded Analytics (EA) making...
132
Voted
AAAI
2006
15 years 3 months ago
2006
My research attempts to address on-line action selection in reinforcement learning from a Bayesian perspective. The idea is to develop more effective action selection techniques b...
131
Voted
ICGI
2004
Springer
15 years 7 months ago
2004
Springer
This paper describes the Omphalos Context-Free Grammar Learning Competition held as part of the International Colloquium on Grammatical Inference 2004. The competition was created ...
112
click to vote
WWW
2005
ACM
16 years 2 months ago
2005
ACM
By far, the support vector machines (SVM) achieve the state-of-theart performance for the text classification (TC) tasks. Due to the complexity of the TC problems, it becomes a ch...