771 search results - page 69 / 155 » Markov Decision Processes with Arbitrary Reward Processes |
127
Voted
INFOCOM
2009
IEEE
15 years 10 months ago
2009
IEEE
—This paper studies the problem of allocating network capacity through periodic auctions. Motivated primarily by a service overlay architecture, we impose the following condition...
114
click to vote
WCNC
2008
IEEE
15 years 10 months ago
2008
IEEE
— A throughput-maximization call admission control (CAC) policy is proposed for CDMA beamforming systems in which the QoS requirements in both physical and network layers can be ...
ICRA
2010
IEEE
15 years 2 months ago
2010
IEEE
—This paper introduces a new algorithm for probabilistic motion planning in arbitrary, uncertain vector fields, with emphasis on high-level planning for Montgolfier´e balloons...
120
click to vote
SIGMETRICS
2002
ACM
15 years 3 months ago
2002
ACM
Probability distributions of response times are important in the design and analysis of transaction processing systems and computercommunication systems. We present a general tech...
117
click to vote
ECML
2006
Springer
15 years 7 months ago
2006
Springer
In this paper we formulate the problem of grouping the states of a discrete Markov chain of arbitrary order simultaneously with deconvolving its transition probabilities. As the na...