771 search results - page 12 / 155 » Markov Decision Processes with Arbitrary Reward Processes |
120
click to vote
ICC
2008
IEEE
15 years 8 months ago
2008
IEEE
—We consider opportunistic communications over multiple channels where the state (“good” or “bad”) of each channel evolves as independent and identically distributed Mark...
FOCS
2003
IEEE
15 years 7 months ago
2003
IEEE
In this paper, we give the rst constant-factor approximationalgorithmfor the rooted Orienteering problem, as well as a new problem that we call the Discounted-Reward TSP, motivate...
160
Voted
ATAL
2010
Springer
15 years 2 months ago
2010
Springer
As learning agents move from research labs to the real world, it is increasingly important that human users, including those without programming skills, be able to teach agents de...
142
click to vote
CORR
2010
Springer
14 years 8 months ago
2010
Springer
We consider an opportunistic spectrum access (OSA) problem where the time-varying condition of each channel (e.g., as a result of random fading or certain primary users' activ...
123
click to vote
ICASSP
2011
IEEE
14 years 5 months ago
2011
IEEE
In this paper, the problem of scalable video delivery over a timevarying wireless channel is considered. Packet scheduling and buffer management in both Application and Medium Acc...