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)

  • 61. Developing Subdomain Allocation Algorithms Based on Spatial and Communicational Constraints to Accelerate Dust Storm Simulation.
    Gui Z; Yu M; Yang C; Jiang Y; Chen S; Xia J; Huang Q; Liu K; Li Z; Hassan MA; Jin B
    PLoS One; 2016; 11(4):e0152250. PubMed ID: 27044039
    [TBL] [Abstract][Full Text] [Related]  

  • 62. Combinatorial logic based digital optical computing architectures.
    Guilfoyle PS; Wiley WJ
    Appl Opt; 1988 May; 27(9):1661-73. PubMed ID: 20531634
    [TBL] [Abstract][Full Text] [Related]  

  • 63. Performance comparison of heuristic algorithms for task scheduling in IaaS cloud computing environment.
    Madni SHH; Abd Latiff MS; Abdullahi M; Abdulhamid SM; Usman MJ
    PLoS One; 2017; 12(5):e0176321. PubMed ID: 28467505
    [TBL] [Abstract][Full Text] [Related]  

  • 64. Revisiting the linear programming relaxation approach to Gibbs energy minimization and weighted constraint satisfaction.
    Werner T
    IEEE Trans Pattern Anal Mach Intell; 2010 Aug; 32(8):1474-88. PubMed ID: 20558878
    [TBL] [Abstract][Full Text] [Related]  

  • 65. On the complexity of discrete feature selection for optimal classification.
    Peña JM; Nilsson R
    IEEE Trans Pattern Anal Mach Intell; 2010 Aug; 32(8):1517-22. PubMed ID: 20558881
    [TBL] [Abstract][Full Text] [Related]  

  • 66. Connected Component Model for Multi-Object Tracking.
    He Z; Li X; You X; Tao D; Tang YY
    IEEE Trans Image Process; 2016 Aug; 25(8):3698-711. PubMed ID: 27214900
    [TBL] [Abstract][Full Text] [Related]  

  • 67. A gradual neural-network approach for frequency assignment in satellite communication systems.
    Funabiki N; Nishikawa S
    IEEE Trans Neural Netw; 1997; 8(6):1359-70. PubMed ID: 18255738
    [TBL] [Abstract][Full Text] [Related]  

  • 68. A Heuristic Initialized Stochastic Memetic Algorithm for MDPVRP With Interdependent Depot Operations.
    Azad AS; Islam M; Chakraborty S
    IEEE Trans Cybern; 2017 Dec; 47(12):4302-4315. PubMed ID: 28141540
    [TBL] [Abstract][Full Text] [Related]  

  • 69. Parallel algorithms for modules of learning automata.
    Thathachar ML; Arvind MT
    IEEE Trans Syst Man Cybern B Cybern; 1998; 28(1):24-33. PubMed ID: 18255919
    [TBL] [Abstract][Full Text] [Related]  

  • 70. Amoeba-Inspired Heuristic Search Dynamics for Exploring Chemical Reaction Paths.
    Aono M; Wakabayashi M
    Orig Life Evol Biosph; 2015 Sep; 45(3):339-45. PubMed ID: 26129639
    [TBL] [Abstract][Full Text] [Related]  

  • 71. A Parameterised Complexity Analysis of Bi-level Optimisation with Evolutionary Algorithms.
    Corus D; Lehre PK; Neumann F; Pourhassan M
    Evol Comput; 2016; 24(1):183-203. PubMed ID: 25700147
    [TBL] [Abstract][Full Text] [Related]  

  • 72. GAMBIT: A Parameterless Model-Based Evolutionary Algorithm for Mixed-Integer Problems.
    Sadowski KL; Thierens D; Bosman PAN
    Evol Comput; 2018; 26(1):117-143. PubMed ID: 28207296
    [TBL] [Abstract][Full Text] [Related]  

  • 73. Model abstraction for discrete-event systems by binary linear programming with applications to manufacturing systems.
    Cheng L; Feng L; Li Z
    Sci Prog; 2021; 104(3):368504211030833. PubMed ID: 34292845
    [TBL] [Abstract][Full Text] [Related]  

  • 74. Fitness function distributions over generalized search neighborhoods in the q-ary hypercube.
    Sutton AM; Chicano F; Whitley LD
    Evol Comput; 2013; 21(4):561-90. PubMed ID: 23163780
    [TBL] [Abstract][Full Text] [Related]  

  • 75. A multilevel memetic algorithm for large SAT-encoded problems.
    Bouhmala N
    Evol Comput; 2012; 20(4):641-64. PubMed ID: 22540191
    [TBL] [Abstract][Full Text] [Related]  

  • 76. Meta-Heuristic Combining Prior Online and Offline Information for the Quadratic Assignment Problem.
    Sun J; Zhang Q; Yao X
    IEEE Trans Cybern; 2014 Mar; 44(3):429-44. PubMed ID: 23757559
    [TBL] [Abstract][Full Text] [Related]  

  • 77. Achieving Fair Load Balancing by Invoking a Learning Automata-Based Two-Time-Scale Separation Paradigm.
    Yazidi A; Hassan I; Hammer HL; Oommen BJ
    IEEE Trans Neural Netw Learn Syst; 2021 Aug; 32(8):3444-3457. PubMed ID: 32755870
    [TBL] [Abstract][Full Text] [Related]  

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

  • 79. A branch-and-bound approach to correspondence and grouping problems.
    Bazin JC; Li H; Kweon IS; Demonceaux C; Vasseur P; Ikeuchi K
    IEEE Trans Pattern Anal Mach Intell; 2013 Jul; 35(7):1565-76. PubMed ID: 23681987
    [TBL] [Abstract][Full Text] [Related]  

  • 80. Network capacity with probit-based stochastic user equilibrium problem.
    Lu L; Wang J; Zheng P; Wang W
    PLoS One; 2017; 12(2):e0171158. PubMed ID: 28178284
    [TBL] [Abstract][Full Text] [Related]  

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