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 *

110 related articles for article (PubMed ID: 18263056)

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

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

  • 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. Discretized learning automata solutions to the capacity assignment problem for prioritized networks.
    Oommen BJ; Roberts TD
    IEEE Trans Syst Man Cybern B Cybern; 2002; 32(6):821-31. PubMed ID: 18244888
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Learning deterministic finite automata with a smart state labeling evolutionary algorithm.
    Lucas SM; Reynolds TJ
    IEEE Trans Pattern Anal Mach Intell; 2005 Jul; 27(7):1063-74. PubMed ID: 16013754
    [TBL] [Abstract][Full Text] [Related]  

  • 9. On-line identification and reconstruction of finite automata with generalized recurrent neural networks.
    Gabrijel I; Dobnikar A
    Neural Netw; 2003 Jan; 16(1):101-20. PubMed ID: 12576110
    [TBL] [Abstract][Full Text] [Related]  

  • 10. A team of continuous-action learning automata for noise-tolerant learning of half-spaces.
    Sastry PS; Nagendra GD; Manwani N
    IEEE Trans Syst Man Cybern B Cybern; 2010 Feb; 40(1):19-28. PubMed ID: 19884058
    [TBL] [Abstract][Full Text] [Related]  

  • 11. A generalized learning algorithm for an automaton operating in a multiteacher environment.
    Ansari A; Papavassilopoulos GP
    IEEE Trans Syst Man Cybern B Cybern; 1999; 29(5):592-600. PubMed ID: 18252337
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Generalized rough and fuzzy rough automata for semantic computing.
    Yadav S; Tiwari SP; Kumari M; Yadav VK
    Int J Mach Learn Cybern; 2022; 13(12):4013-4032. PubMed ID: 36164557
    [TBL] [Abstract][Full Text] [Related]  

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

  • 14. Automata learning and intelligent tertiary searching for stochastic point location.
    Oommen BJ; Raghunath G
    IEEE Trans Syst Man Cybern B Cybern; 1998; 28(6):947-54. PubMed ID: 18256016
    [TBL] [Abstract][Full Text] [Related]  

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

  • 16. Solving multiconstraint assignment problems using learning automata.
    Horn G; Oommen BJ
    IEEE Trans Syst Man Cybern B Cybern; 2010 Feb; 40(1):6-18. PubMed ID: 19884057
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Convergence time for the linkage learning genetic algorithm.
    Chen YP; Goldberg DE
    Evol Comput; 2005; 13(3):279-302. PubMed ID: 16156925
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Multimodal searching technique based on learning automata with continuous input and changing number of actions.
    Najim K; Poznyak AS
    IEEE Trans Syst Man Cybern B Cybern; 1996; 26(4):666-73. PubMed ID: 18263067
    [TBL] [Abstract][Full Text] [Related]  

  • 19. MEC--a near-optimal online reinforcement learning algorithm for continuous deterministic systems.
    Zhao D; Zhu Y
    IEEE Trans Neural Netw Learn Syst; 2015 Feb; 26(2):346-56. PubMed ID: 25474812
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Efficient Deterministic Finite Automata Minimization Based on Backward Depth Information.
    Liu D; Huang Z; Zhang Y; Guo X; Su S
    PLoS One; 2016; 11(11):e0165864. PubMed ID: 27806102
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 6.