Sciweavers

200 search results - page 16 / 40
» Point-Based Policy Iteration
Sort
View
PKDD
2010
Springer
164views Data Mining» more  PKDD 2010»
13 years 5 months ago
Efficient Planning in Large POMDPs through Policy Graph Based Factorized Approximations
Partially observable Markov decision processes (POMDPs) are widely used for planning under uncertainty. In many applications, the huge size of the POMDP state space makes straightf...
Joni Pajarinen, Jaakko Peltonen, Ari Hottinen, Mik...
PKDD
2009
Springer
169views Data Mining» more  PKDD 2009»
14 years 2 months ago
Hybrid Least-Squares Algorithms for Approximate Policy Evaluation
The goal of approximate policy evaluation is to “best” represent a target value function according to a specific criterion. Temporal difference methods and Bellman residual m...
Jeffrey Johns, Marek Petrik, Sridhar Mahadevan
ASM
2010
ASM
14 years 2 months ago
Secrecy UML Method for Model Transformations
Abstract. This paper introduces the subject of secrecy models development by transformation, with formal validation. In an enterprise, constructing a secrecy model is a participato...
Waël Hassan, Nadera Slimani, Kamel Adi, Luigi...
CORR
2011
Springer
175views Education» more  CORR 2011»
13 years 2 months ago
Adaptive Channel Recommendation for Dynamic Spectrum Access
—We propose a dynamic spectrum access scheme where secondary users recommend “good” channels to each other and access accordingly. We formulate the problem as an average rewa...
Xu Chen, Jianwei Huang, Husheng Li
IJHPCA
2006
109views more  IJHPCA 2006»
13 years 7 months ago
A Resource Leasing Policy for on-Demand Computing
Leasing computational resources for on-demand computing is now a viable option for providers of network services. Temporary spikes or lulls in demand for a service can be accommod...
Darin England, Jon B. Weissman