메뉴 건너뛰기




Volumn , Issue , 2009, Pages

Multi-armed bandit based policies for cognitive radio's decision making issues

Author keywords

Cognitive radio; Decision making; Multi armed bandit; Upper confidence bound algorithm

Indexed keywords

COGNITIVE RADIO; MULTI ARMED BANDIT; MULTI-ARMED BANDIT PROBLEM; UPPER CONFIDENCE BOUND;

EID: 77951437208     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICSCS.2009.5412697     Document Type: Conference Paper
Times cited : (58)

References (15)
  • 1
    • 0033171330 scopus 로고    scopus 로고
    • Cognitive radio: Making software radios more personal
    • August
    • J. Mitola and G.Q. Maguire. Cognitive radio: making software radios more personal. Personal Communications, IEEE, 6: 13-18, August 1999.
    • (1999) Personal Communications, IEEE , vol.6 , pp. 13-18
    • Mitola, J.1    Maguire, G.Q.2
  • 2
    • 0011716051 scopus 로고
    • Dual control theory, parts i
    • April
    • A.A. Feldbaum. Dual control theory, parts i. Automation and Remote Control, 21, No.9:874-880, April 1961.
    • (1961) Automation and Remote Control , vol.21 , Issue.9 , pp. 874-880
    • Feldbaum, A.A.1
  • 3
    • 0011716051 scopus 로고
    • Dual control, theory, parts ii
    • May
    • A.A. Feldbaum. Dual control, theory, parts ii. Automation and Remote Control, 21, No.11: 1033-1039, May 1961.
    • (1961) Automation and Remote Control , vol.21 , Issue.11 , pp. 1033-1039
    • Feldbaum, A.A.1
  • 4
    • 0031070051 scopus 로고    scopus 로고
    • Optimal adaptive policies for markov decision processes
    • A. N. Burnetas and M. N. Katehakis. Optimal adaptive policies for markov decision processes. Mathematics of Operations Research, 22(1): 222-255, 1997.
    • (1997) Mathematics of Operations Research , vol.22 , Issue.1 , pp. 222-255
    • Burnetas, A.N.1    Katehakis, M.N.2
  • 5
    • 84966203785 scopus 로고
    • Some aspects of the sequential design of experiments
    • H. Robbins. Some aspects of the sequential design of experiments. Bulletin of American Mathematical. Society, 58: 527-535, 1952.
    • (1952) Bulletin of American Mathematical Society , vol.58 , pp. 527-535
    • Robbins, H.1
  • 6
    • 0036568025 scopus 로고    scopus 로고
    • Finite time analysis of multiarmed bandit problems
    • P. Auer, N. Cesa-Bianchi, and P. Fischer. Finite time analysis of multiarmed bandit problems. Machine learning, 47(2/3): 235-256, 2002.
    • (2002) Machine Learning , vol.47 , Issue.2-3 , pp. 235-256
    • Auer, P.1    Cesa-Bianchi, N.2    Fischer, P.3
  • 13
    • 0002899547 scopus 로고
    • Asymptotically efficient adaptive allocation rales
    • T.L. Lai and H. Robbins. Asymptotically efficient adaptive allocation rales. Advances in Applied Mathematics, 6: 4-22, 1985.
    • (1985) Advances in Applied Mathematics , vol.6 , pp. 4-22
    • Lai, T.L.1    Robbins, H.2
  • 14
    • 0000616723 scopus 로고
    • Sample mean based index policies with o(log(n)) regret for the multi-armed bandit problem
    • R. Agrawal. Sample mean based index policies with o(log(n)) regret for the multi-armed bandit problem. Advances in Applied Probability, 27: 1054-1078, 1995.
    • (1995) Advances in Applied Probability , vol.27 , pp. 1054-1078
    • Agrawal, R.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.