Sciweavers

771 search results - page 120 / 155
» Markov Decision Processes with Arbitrary Reward Processes
Sort
View
TMC
2011
219views more  TMC 2011»
14 years 8 months ago
Optimal Channel Access Management with QoS Support for Cognitive Vehicular Networks
We consider the problem of optimal channel access to provide quality of service (QoS) for data transmission in cognitive vehicular networks. In such a network the vehicular nodes ...
Dusit Niyato, Ekram Hossain, Ping Wang
184
Voted
ICDCS
2012
IEEE
13 years 4 months ago
Towards Optimal Capacity Segmentation with Hybrid Cloud Pricing
—Cloud resources are usually priced in multiple markets with different service guarantees. For example, Amazon EC2 prices virtual instances under three pricing schemes — the su...
Wei Wang, Baochun Li, Ben Liang
ALDT
2009
Springer
142views Algorithms» more  ALDT 2009»
15 years 8 months ago
Finding Best k Policies
Abstract. An optimal probabilistic-planning algorithm solves a problem, usually modeled by a Markov decision process, by finding its optimal policy. In this paper, we study the k ...
Peng Dai, Judy Goldsmith
ICIS
2003
15 years 3 months ago
A Computational Approach to Compare Information Revelation Policies
Revelation policies in an e-marketplace differ in terms of the level of competitive information disseminated to participating sellers. Since sellers who repeatedly compete against...
Amy R. Greenwald, Karthik Kannan, Ramayya Krishnan
ATAL
2010
Springer
14 years 9 months ago
Approximate dynamic programming with affine ADDs
The Affine ADD (AADD) is an extension of the Algebraic Decision Diagram (ADD) that compactly represents context-specific, additive and multiplicative structure in functions from a...
Scott Sanner, William T. B. Uther, Karina Valdivia...