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 *

143 related articles for article (PubMed ID: 24710837)

  • 1. 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]  

  • 2. 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]  

  • 3. 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]  

  • 4. 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]  

  • 5. 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]  

  • 6. A relative reward-strength algorithm for the hierarchical structure learning automata operating in the general nonstationary multiteacher environment.
    Baba N; Mogami Y
    IEEE Trans Syst Man Cybern B Cybern; 2006 Aug; 36(4):781-94. PubMed ID: 16903364
    [TBL] [Abstract][Full Text] [Related]  

  • 7. 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]  

  • 8. Decentralized indirect methods for learning automata games.
    Tilak O; Martin R; Mukhopadhyay S
    IEEE Trans Syst Man Cybern B Cybern; 2011 Oct; 41(5):1213-23. PubMed ID: 21925998
    [TBL] [Abstract][Full Text] [Related]  

  • 9. 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]  

  • 10. 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]  

  • 11. New learning automata based algorithms for adaptation of backpropagation algorithm parameters.
    Meybodi MR; Beigy H
    Int J Neural Syst; 2002 Feb; 12(1):45-67. PubMed ID: 11852444
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Efficient model learning methods for actor-critic control.
    Grondman I; Vaandrager M; Buşoniu L; Babuska R; Schuitema E
    IEEE Trans Syst Man Cybern B Cybern; 2012 Jun; 42(3):591-602. PubMed ID: 22156998
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Optimal control in microgrid using multi-agent reinforcement learning.
    Li FD; Wu M; He Y; Chen X
    ISA Trans; 2012 Nov; 51(6):743-51. PubMed ID: 22824135
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Enhanced differential evolution with adaptive strategies for numerical optimization.
    Gong W; Cai Z; Ling CX; Li H
    IEEE Trans Syst Man Cybern B Cybern; 2011 Apr; 41(2):397-413. PubMed ID: 20837448
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Partially observable Markov decision processes and performance sensitivity analysis.
    Li Y; Yin B; Xi H
    IEEE Trans Syst Man Cybern B Cybern; 2008 Dec; 38(6):1645-51. PubMed ID: 19022734
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Fast rule identification and neighborhood selection for cellular automata.
    Sun X; Rosin PL; Martin RR
    IEEE Trans Syst Man Cybern B Cybern; 2011 Jun; 41(3):749-60. PubMed ID: 21134817
    [TBL] [Abstract][Full Text] [Related]  

  • 17. 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]  

  • 18. A general CPL-AdS methodology for fixing dynamic parameters in dual environments.
    Huang DS; Jiang W
    IEEE Trans Syst Man Cybern B Cybern; 2012 Oct; 42(5):1489-500. PubMed ID: 22562768
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Robust alternative minimization for matrix completion.
    Lu X; Gong T; Yan P; Yuan Y; Li X
    IEEE Trans Syst Man Cybern B Cybern; 2012 Jun; 42(3):939-49. PubMed ID: 22345545
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Achieving microaggregation for secure statistical databases using fixed-structure partitioning-based learning automata.
    Fayyoumi E; Oommen BJ
    IEEE Trans Syst Man Cybern B Cybern; 2009 Oct; 39(5):1192-205. PubMed ID: 19336315
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 8.