These tools will no longer be maintained as of December 31, 2024. Archived website can be found here. PubMed4Hh GitHub repository can be found here. Contact NLM Customer Service if you have questions.


BIOMARKERS

Molecular Biopsy of Human Tumors

- a resource for Precision Medicine *

119 related articles for article (PubMed ID: 37015672)

  • 1. The Hierarchical Discrete Pursuit Learning Automaton: A Novel Scheme With Fast Convergence and Epsilon-Optimality.
    Omslandseter RO; Jiao L; Zhang X; Yazidi A; Oommen BJ
    IEEE Trans Neural Netw Learn Syst; 2024 Jun; 35(6):8278-8292. PubMed ID: 37015672
    [TBL] [Abstract][Full Text] [Related]  

  • 2. The Hierarchical Continuous Pursuit Learning Automation: A Novel Scheme for Environments With Large Numbers of Actions.
    Yazidi A; Zhang X; Jiao L; Oommen BJ
    IEEE Trans Neural Netw Learn Syst; 2020 Feb; 31(2):512-526. PubMed ID: 30990443
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Fast and Epsilon-Optimal Discretized Pursuit Learning Automata.
    Zhang J; Wang C; Zhou M
    IEEE Trans Cybern; 2015 Oct; 45(10):2089-99. PubMed ID: 25415995
    [TBL] [Abstract][Full Text] [Related]  

  • 4. Last-position elimination-based learning automata.
    Zhang J; Wang C; Zhou M
    IEEE Trans Cybern; 2014 Dec; 44(12):2484-92. PubMed ID: 24710837
    [TBL] [Abstract][Full Text] [Related]  

  • 5. Continuous and discretized pursuit learning schemes: various algorithms and their comparison.
    Oommen BJ; Agache M
    IEEE Trans Syst Man Cybern B Cybern; 2001; 31(3):277-87. PubMed ID: 18244792
    [TBL] [Abstract][Full Text] [Related]  

  • 6. A Conclusive Analysis of the Finite-Time Behavior of the Discretized Pursuit Learning Automaton.
    Zhang X; Jiao L; Oommen BJ; Granmo OC
    IEEE Trans Neural Netw Learn Syst; 2020 Jan; 31(1):284-294. PubMed ID: 30908268
    [TBL] [Abstract][Full Text] [Related]  

  • 7. Generalized pursuit learning schemes: new families of continuous and discretized learning automata.
    Agache M; Oommen BJ
    IEEE Trans Syst Man Cybern B Cybern; 2002; 32(6):738-49. PubMed ID: 18244880
    [TBL] [Abstract][Full Text] [Related]  

  • 8. A new class of epsilon-optimal learning automata.
    Papadimitriou GI; Sklira M; Pomportsis AS
    IEEE Trans Syst Man Cybern B Cybern; 2004 Feb; 34(1):246-54. PubMed ID: 15369067
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Discretizing Continuous Action Space With Unimodal Probability Distributions for On-Policy Reinforcement Learning.
    Zhu Y; Wang Z; Zhu Y; Chen C; Zhao D
    IEEE Trans Neural Netw Learn Syst; 2024 Aug; PP():. PubMed ID: 39190528
    [TBL] [Abstract][Full Text] [Related]  

  • 10. An Efficient Parameter-Free Learning Automaton Scheme.
    Di C; Liang Q; Li F; Li S; Luo F
    IEEE Trans Neural Netw Learn Syst; 2021 Nov; 32(11):4849-4863. PubMed ID: 33017293
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Solving Two-Person Zero-Sum Stochastic Games With Incomplete Information Using Learning Automata With Artificial Barriers.
    Yazidi A; Silvestre D; Oommen BJ
    IEEE Trans Neural Netw Learn Syst; 2023 Feb; 34(2):650-661. PubMed ID: 34347605
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Achieving Fair Load Balancing by Invoking a Learning Automata-Based Two-Time-Scale Separation Paradigm.
    Yazidi A; Hassan I; Hammer HL; Oommen BJ
    IEEE Trans Neural Netw Learn Syst; 2021 Aug; 32(8):3444-3457. PubMed ID: 32755870
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Finite time analysis of the pursuit algorithm for learning automata.
    Rajaraman K; Sastry PS
    IEEE Trans Syst Man Cybern B Cybern; 1996; 26(4):590-8. PubMed ID: 18263056
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Random early detection for congestion avoidance in wired networks: a discretized pursuit learning-automata-like solution.
    Misra S; Oommen BJ; Yanamandra S; Obaidat MS
    IEEE Trans Syst Man Cybern B Cybern; 2010 Feb; 40(1):66-76. PubMed ID: 19884062
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Varieties of learning automata: an overview.
    Thathachar ML; Sastry PS
    IEEE Trans Syst Man Cybern B Cybern; 2002; 32(6):711-22. PubMed ID: 18244878
    [TBL] [Abstract][Full Text] [Related]  

  • 16. A novel strategy for solving the stochastic point location problem using a hierarchical searching scheme.
    Yazidi A; Granmo OC; John Oommen B; Goodwin M
    IEEE Trans Cybern; 2014 Nov; 44(11):2202-20. PubMed ID: 25330192
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Modeling a student's behavior in a tutorial-like system using learning automata.
    Oommen BJ; Hashem MK
    IEEE Trans Syst Man Cybern B Cybern; 2010 Apr; 40(2):481-92. PubMed ID: 19744915
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Parameter learning from stochastic teachers and stochastic compulsive liars.
    Oommen BJ; Raghunath G; Kuipers B
    IEEE Trans Syst Man Cybern B Cybern; 2006 Aug; 36(4):820-34. PubMed ID: 16903367
    [TBL] [Abstract][Full Text] [Related]  

  • 19. A reward optimization method based on action subrewards in hierarchical reinforcement learning.
    Fu Y; Liu Q; Ling X; Cui Z
    ScientificWorldJournal; 2014; 2014():120760. PubMed ID: 24600318
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Quantum reinforcement learning.
    Dong D; Chen C; Li H; Tarn TJ
    IEEE Trans Syst Man Cybern B Cybern; 2008 Oct; 38(5):1207-20. PubMed ID: 18784007
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 6.