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 *

240 related articles for article (PubMed ID: 19884057)

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

  • 82. The airport gate assignment problem: a survey.
    Bouras A; Ghaleb MA; Suryahatmaja US; Salem AM
    ScientificWorldJournal; 2014; 2014():923859. PubMed ID: 25506074
    [TBL] [Abstract][Full Text] [Related]  

  • 83. The wisdom of the crowd in combinatorial problems.
    Yi SK; Steyvers M; Lee MD; Dry MJ
    Cogn Sci; 2012 Apr; 36(3):452-70. PubMed ID: 22268680
    [TBL] [Abstract][Full Text] [Related]  

  • 84. A New Random Forest Algorithm Based on Learning Automata.
    Savargiv M; Masoumi B; Keyvanpour MR
    Comput Intell Neurosci; 2021; 2021():5572781. PubMed ID: 33854542
    [TBL] [Abstract][Full Text] [Related]  

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

  • 86. Polynomial convolution algorithm for matrix multiplication with application for optical computing.
    Barakat R; Reif J
    Appl Opt; 1987 Jul; 26(14):2707-11. PubMed ID: 20489949
    [TBL] [Abstract][Full Text] [Related]  

  • 87. Assigning cells to switches in cellular mobile networks using taboo search.
    Pierre S; Houeto F
    IEEE Trans Syst Man Cybern B Cybern; 2002; 32(3):351-6. PubMed ID: 18238132
    [TBL] [Abstract][Full Text] [Related]  

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

  • 89. A methodology to find the elementary landscape decomposition of combinatorial optimization problems.
    Chicano F; Whitley LD; Alba E
    Evol Comput; 2011; 19(4):597-637. PubMed ID: 21469972
    [TBL] [Abstract][Full Text] [Related]  

  • 90. Learning in multilevel games with incomplete information. II.
    Zhou J; Billard E; Lakshmivarahan S
    IEEE Trans Syst Man Cybern B Cybern; 1999; 29(3):340-9. PubMed ID: 18252309
    [TBL] [Abstract][Full Text] [Related]  

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

  • 92. Efficient partition of integer optimization problems with one-hot encoding.
    Okada S; Ohzeki M; Taguchi S
    Sci Rep; 2019 Sep; 9(1):13036. PubMed ID: 31506502
    [TBL] [Abstract][Full Text] [Related]  

  • 93. An outer approximation method for the road network design problem.
    Asadi Bagloee S; Sarvi M
    PLoS One; 2018; 13(3):e0192454. PubMed ID: 29590111
    [TBL] [Abstract][Full Text] [Related]  

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

  • 95. Computational properties of self-reproducing growing automata.
    Sosic R; Johnson RR
    Biosystems; 1995; 36(1):7-17. PubMed ID: 8527697
    [TBL] [Abstract][Full Text] [Related]  

  • 96. A gradual neural-network algorithm for jointly time-slot/code assignment problems in packet radio networks.
    Funabiki N; Kitamichi J
    IEEE Trans Neural Netw; 1998; 9(6):1523-8. PubMed ID: 18255830
    [TBL] [Abstract][Full Text] [Related]  

  • 97. Solving constraint satisfaction and optimization problems by a neuro-fuzzy approach.
    Cavalieri S; Russo M
    IEEE Trans Syst Man Cybern B Cybern; 1999; 29(6):895-902. PubMed ID: 18252367
    [TBL] [Abstract][Full Text] [Related]  

  • 98. The backtracking survey propagation algorithm for solving random K-SAT problems.
    Marino R; Parisi G; Ricci-Tersenghi F
    Nat Commun; 2016 Oct; 7():12996. PubMed ID: 27694952
    [TBL] [Abstract][Full Text] [Related]  

  • 99. Sim-DRS: a similarity-based dynamic resource scheduling algorithm for microservice-based web systems.
    Li Y; Li T; Shen P; Hao L; Liu W; Wang S; Song Y; Bao L
    PeerJ Comput Sci; 2021; 7():e824. PubMed ID: 35036538
    [TBL] [Abstract][Full Text] [Related]  

  • 100. An Efficient Multilinear Optimization Framework for Hypergraph Matching.
    Nguyen Q; Tudisco F; Gautier A; Hein M
    IEEE Trans Pattern Anal Mach Intell; 2017 Jun; 39(6):1054-1075. PubMed ID: 27254858
    [TBL] [Abstract][Full Text] [Related]  

    [Previous]   [Next]    [New Search]
    of 12.