Sciweavers

332 search results - page 41 / 67
» Ranking policies in discrete Markov decision processes
Sort
View
GLOBECOM
2006
IEEE
14 years 2 months ago
Optimal Routing Between Alternate Paths With Different Network Transit Delays
— We consider the path-determination problem in Internet core routers that distribute flows across alternate paths leading to the same destination. We assume that the remainder ...
Essia Hamouda Elhafsi, Mart Molle
CORR
2008
Springer
189views Education» more  CORR 2008»
13 years 8 months ago
Algorithms for Dynamic Spectrum Access with Learning for Cognitive Radio
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 cooperati...
Jayakrishnan Unnikrishnan, Venugopal V. Veeravalli
FOCS
2007
IEEE
14 years 2 months ago
Approximation Algorithms for Partial-Information Based Stochastic Control with Markovian Rewards
We consider a variant of the classic multi-armed bandit problem (MAB), which we call FEEDBACK MAB, where the reward obtained by playing each of n independent arms varies according...
Sudipto Guha, Kamesh Munagala
TASE
2008
IEEE
13 years 8 months ago
Optimization of Joint Replacement Policies for Multipart Systems by a Rollout Framework
Maintaining an asset with life-limited parts, e.g., a jet engine or an electric generator, may be costly. Certain costs, e.g., setup cost, can be shared if some parts of the asset ...
Tao Sun, Qianchuan Zhao, Peter B. Luh, Robert N. T...
SIGMETRICS
2010
ACM
195views Hardware» more  SIGMETRICS 2010»
14 years 15 min ago
CWS: a model-driven scheduling policy for correlated workloads
We define CWS, a non-preemptive scheduling policy for workloads with correlated job sizes. CWS tackles the scheduling problem by inferring the expected sizes of upcoming jobs bas...
Giuliano Casale, Ningfang Mi, Evgenia Smirni