Opportunistic Spectrum Access with Channel Switching Cost for Cognitive Radio Networks
暂无分享,去创建一个
[1] D. Teneketzis,et al. Asymptotically efficient adaptive allocation rules for the multiarmed bandit problem with switching cost , 1988 .
[2] Keith D. Kastella,et al. Foundations and Applications of Sensor Management , 2010 .
[3] T. L. Lai Andherbertrobbins. Asymptotically Efficient Adaptive Allocation Rules , 1985 .
[4] DE Economist. A SURVEY ON THE BANDIT PROBLEM WITH SWITCHING COSTS , 2004 .
[5] Peter Auer,et al. Finite-time Analysis of the Multiarmed Bandit Problem , 2002, Machine Learning.
[6] Simon Haykin,et al. Cognitive radio: brain-empowered wireless communications , 2005, IEEE Journal on Selected Areas in Communications.
[7] M.M. Buddhikot,et al. Understanding Dynamic Spectrum Access: Models,Taxonomy and Challenges , 2007, 2007 2nd IEEE International Symposium on New Frontiers in Dynamic Spectrum Access Networks.
[8] R. Agrawal. Sample mean based index policies by O(log n) regret for the multi-armed bandit problem , 1995, Advances in Applied Probability.
[9] J. Bather,et al. Multi‐Armed Bandit Allocation Indices , 1990 .
[10] Qing Zhao,et al. Distributed Learning in Multi-Armed Bandit With Multiple Players , 2009, IEEE Transactions on Signal Processing.
[11] Ao Tang,et al. Opportunistic Spectrum Access with Multiple Users: Learning under Competition , 2010, 2010 Proceedings IEEE INFOCOM.
[12] Christian M. Ernst,et al. Multi-armed Bandit Allocation Indices , 1989 .
[13] Demosthenis Teneketzis,et al. Multi-Armed Bandit Problems , 2008 .
[14] Ananthram Swami,et al. Distributed Algorithms for Learning and Cognitive Medium Access with Logarithmic Regret , 2010, IEEE Journal on Selected Areas in Communications.