334 search results - page 34 / 67 » How to Dynamically Merge Markov Decision Processes |
123
Voted
CDC
2008
IEEE
15 years 10 months ago
2008
IEEE
— In this paper we study the problem of dynamic optimization of ping schedule in an active sonar buoy network deployed to provide persistent surveillance of a littoral area throu...
137
click to vote
WCNC
2010
IEEE
15 years 7 months ago
2010
IEEE
—Controlled mobile helper nodes called data ferries have recently been proposed to bridge communications between disconnected nodes in a delay-tolerant manner. While existing wor...
129
Voted
CDC
2008
IEEE
15 years 10 months ago
2008
IEEE
—We study the problem of dynamic spectrum sensing and access in cognitive radio systems as a partially observed Markov decision process (POMDP). A group of cognitive users cooper...
133
click to vote
IPPS
2002
IEEE
15 years 9 months ago
2002
IEEE
A bulk synchronous computation proceeds in phases that are separated by barrier synchronization. For dynamic bulk synchronous computations that exhibit varying phase-wise computat...
129
click to vote
NIPS
2008
15 years 5 months ago
2008
Most algorithms for solving Markov decision processes rely on a discount factor, which ensures their convergence. It is generally assumed that using an artificially low discount f...