All-Powerful Learning Algorithm for the Priority Access in Cognitive Network
暂无分享,去创建一个
[1] Victor C. M. Leung,et al. Rank-optimal channel selection strategy in cognitive networks , 2012, 2012 IEEE Global Communications Conference (GLOBECOM).
[2] T. L. Lai Andherbertrobbins. Asymptotically Efficient Adaptive Allocation Rules , 1985 .
[3] D. Ernst,et al. Upper Confidence Bound Based Decision Making Strategies and Dynamic Spectrum Access , 2010, 2010 IEEE International Conference on Communications.
[4] W. R. Thompson. ON THE LIKELIHOOD THAT ONE UNKNOWN PROBABILITY EXCEEDS ANOTHER IN VIEW OF THE EVIDENCE OF TWO SAMPLES , 1933 .
[5] Peter Auer,et al. Finite-time Analysis of the Multiarmed Bandit Problem , 2002, Machine Learning.
[6] Ohad Shamir,et al. Multi-player bandits: a musical chairs approach , 2016, ICML 2016.
[7] A. Assoum,et al. Opportunistic Spectrum Access in Cognitive Radio for Tactical Network , 2018, 2018 2nd European Conference on Electrical Engineering and Computer Science (EECS).
[8] Mohamad Chaitou,et al. Spatial and time diversities for canonical correlation significance test in spectrum sensing , 2016, 2016 24th European Signal Processing Conference (EUSIPCO).
[9] Shie Mannor,et al. Concurrent Bandits and Cognitive Radio Networks , 2014, ECML/PKDD.
[10] Rohit Kumar,et al. Channel Selection for Secondary Users in Decentralized Network of Unknown Size , 2017, IEEE Communications Letters.
[11] Joseph Mitola,et al. Cognitive radio: making software radios more personal , 1999, IEEE Wirel. Commun..
[12] Yi Gai,et al. Decentralized Online Learning Algorithms for Opportunistic Spectrum Access , 2011, 2011 IEEE Global Telecommunications Conference - GLOBECOM 2011.