238 search results - page 31 / 48 » Value-Function Approximations for Partially Observable Marko... |
ECML
2007
Springer
15 years 6 months ago
2007
Springer
In this article, we present an idea for solving deterministic partially observable markov decision processes (POMDPs) based on a history space containing sequences of past observat...
109
Voted
ICN
2007
Springer
15 years 6 months ago
2007
Springer
— In this paper, we use the Markov Decision Process (MDP) technique to find the optimal code allocation policy in High-Speed Downlink Packet Access (HSDPA) networks. A discrete ...
ICASSP
2008
IEEE
15 years 6 months ago
2008
IEEE
—We aim to characterize the maximum link throughput of a multi-channel opportunistic communication system. The states of these channels evolve as independent and identically dist...
110
click to vote
ATAL
2009
Springer
15 years 6 months ago
2009
Springer
The field of transfer learning aims to speed up learning across multiple related tasks by transferring knowledge between source and target tasks. Past work has shown that when th...
ICRA
2008
IEEE
15 years 6 months ago
2008
IEEE
Abstract— We propose a new approximate algorithm, LAJIV (Lookahead J-MDP Information Value), to solve Oracular Partially Observable Markov Decision Problems (OPOMDPs), a special ...