262 search results - page 48 / 53 » Bounded-Parameter Partially Observable Markov Decision Proce... |
CORR
2007
Springer
13 years 11 months ago
2007
Springer
— This paper explores optimization of paging and registration policies in cellular networks. Motion is modeled as a discrete-time Markov process, and minimization of the discount...
CPAIOR
2008
Springer
14 years 21 days ago
2008
Springer
The one-step anticipatory algorithm (1s-AA) is an online algorithm making decisions under uncertainty by ignoring future non-anticipativity constraints. It makes near-optimal decis...
KDD
2008
ACM
14 years 11 months ago
2008
ACM
IT problem management calls for quick identification of resolvers to reported problems. The efficiency of this process highly depends on ticket routing--transferring problem ticke...
ICN
2007
Springer
14 years 5 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
2011
IEEE
13 years 2 months ago
2011
IEEE
We address several challenges for applying statistical dialog managers based on Partially Observable Markov Models to real world problems: to deal with large numbers of concepts, ...