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 *

103 related articles for article (PubMed ID: 18244792)

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

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

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

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

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

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

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

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

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

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

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

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

  • 13. Multiple response learning automata.
    Economides AA
    IEEE Trans Syst Man Cybern B Cybern; 1996; 26(1):153-6. PubMed ID: 18263016
    [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. 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]  

  • 16. The STAR automaton: expediency and optimality properties.
    Economides AA; Kehagias A
    IEEE Trans Syst Man Cybern B Cybern; 2002; 32(6):723-37. PubMed ID: 18244879
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

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

    [Next]    [New Search]
    of 6.