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 *

124 related articles for article (PubMed ID: 18244888)

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

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

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

  • 4. Cellular learning automata with multiple learning automata in each cell and its applications.
    Beigy H; Meybodi MR
    IEEE Trans Syst Man Cybern B Cybern; 2010 Feb; 40(1):54-65. PubMed ID: 19884061
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

  • 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. An impatient evolutionary algorithm with probabilistic tabu search for unified solution of some NP-hard problems in graph and set theory via clique finding.
    Guturu P; Dantu R
    IEEE Trans Syst Man Cybern B Cybern; 2008 Jun; 38(3):645-66. PubMed ID: 18558530
    [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. 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]  

  • 12. A deterministic annealing algorithm for approximating a solution of the min-bisection problem.
    Dang C; Ma W; Liang J
    Neural Netw; 2009 Jan; 22(1):58-66. PubMed ID: 18995985
    [TBL] [Abstract][Full Text] [Related]  

  • 13. A hyper-heuristic for the Longest Common Subsequence problem.
    Tabataba FS; Mousavi SR
    Comput Biol Chem; 2012 Feb; 36():42-54. PubMed ID: 22286085
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Learning graph matching.
    Caetano TS; McAuley JJ; Cheng L; Le QV; Smola AJ
    IEEE Trans Pattern Anal Mach Intell; 2009 Jun; 31(6):1048-58. PubMed ID: 19372609
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Formal analysis, hardness, and algorithms for extracting internal structure of test-based problems.
    Jaśkowski W; Krawiec K
    Evol Comput; 2011; 19(4):639-71. PubMed ID: 21815770
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Evolution of cellular automata with memory: The Density Classification Task.
    Stone C; Bull L
    Biosystems; 2009 Aug; 97(2):108-16. PubMed ID: 19442703
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Learning automata-based solutions to the nonlinear fractional knapsack problem with applications to optimal resource allocation.
    Granmo OC; Oommen BJ; Myrer SA; Olsen MG
    IEEE Trans Syst Man Cybern B Cybern; 2007 Feb; 37(1):166-75. PubMed ID: 17278569
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Video-on-demand network design and maintenance using fuzzy optimization.
    Abadpour A; Alfa AS; Diamond J
    IEEE Trans Syst Man Cybern B Cybern; 2008 Apr; 38(2):404-20. PubMed ID: 18348923
    [TBL] [Abstract][Full Text] [Related]  

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

  • 20. The generalized quadratic knapsack problem. A neuronal network approach.
    Talaván PM; Yáñez J
    Neural Netw; 2006 May; 19(4):416-28. PubMed ID: 16488117
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 7.