771 search results - page 62 / 155 » Markov Decision Processes with Arbitrary Reward Processes |
137
click to vote
QEST
2008
IEEE
15 years 10 months ago
2008
IEEE
We begin by observing that (discrete-time) QuasiBirth-Death Processes (QBDs) are equivalent, in a precise sense, to (discrete-time) probabilistic 1-Counter Automata (p1CAs), and b...
152
click to vote
IJCNN
2000
IEEE
15 years 7 months ago
2000
IEEE
This paper presents an unsupervised segmentation method for feature sequences based on competitivelearning hidden Markov models. Models associated with the nodes of the Self-Organ...
164
click to vote
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
We consider the problem of energy-efficient point-to-point transmission of delay-sensitive data (e.g. multimedia data) over a fading channel. We propose a rigorous and unified fra...
173
click to vote
INFOCOM
2012
IEEE
13 years 6 months ago
2012
IEEE
Abstract—The problem of minimizing queueing delay of opportunistic access of multiple continuous time Markov channels is considered. A new access policy based on myopic sensing a...
112
click to vote
ATAL
2006
Springer
15 years 7 months ago
2006
Springer
In this paper we describe the initial results of an investigation into the relationship between Markov Decision Processes (MDPs) and Belief-Desire-Intention (BDI) architectures. W...