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 *

107 related articles for article (PubMed ID: 16468566)

  • 21. Complexity of several constraint-satisfaction problems using the heuristic classical algorithm WalkSAT.
    Guidetti M; Young AP
    Phys Rev E Stat Nonlin Soft Matter Phys; 2011 Jul; 84(1 Pt 1):011102. PubMed ID: 21867108
    [TBL] [Abstract][Full Text] [Related]  

  • 22. Searching for feasible stationary states in reaction networks by solving a Boolean constraint satisfaction problem.
    Seganti A; De Martino A; Ricci-Tersenghi F
    Phys Rev E Stat Nonlin Soft Matter Phys; 2014 Feb; 89(2):022139. PubMed ID: 25353454
    [TBL] [Abstract][Full Text] [Related]  

  • 23. A dynamic hybrid framework for constrained evolutionary optimization.
    Wang Y; Cai Z
    IEEE Trans Syst Man Cybern B Cybern; 2012 Feb; 42(1):203-17. PubMed ID: 21824851
    [TBL] [Abstract][Full Text] [Related]  

  • 24. Enhanced differential evolution with adaptive strategies for numerical optimization.
    Gong W; Cai Z; Ling CX; Li H
    IEEE Trans Syst Man Cybern B Cybern; 2011 Apr; 41(2):397-413. PubMed ID: 20837448
    [TBL] [Abstract][Full Text] [Related]  

  • 25. A self-learning particle swarm optimizer for global optimization problems.
    Li C; Yang S; Nguyen TT
    IEEE Trans Syst Man Cybern B Cybern; 2012 Jun; 42(3):627-46. PubMed ID: 22067435
    [TBL] [Abstract][Full Text] [Related]  

  • 26. Implementing online natural gradient learning: problems and solutions.
    Wan W
    IEEE Trans Neural Netw; 2006 Mar; 17(2):317-29. PubMed ID: 16566461
    [TBL] [Abstract][Full Text] [Related]  

  • 27. A Multiobjective Approach to Homography Estimation.
    Osuna-Enciso V; Cuevas E; Oliva D; Zúñiga V; Pérez-Cisneros M; Zaldívar D
    Comput Intell Neurosci; 2016; 2016():3629174. PubMed ID: 26839532
    [TBL] [Abstract][Full Text] [Related]  

  • 28. An Effective Evolutionary Hybrid for Solving the Permutation Flowshop Scheduling Problem.
    Amirghasemi M; Zamani R
    Evol Comput; 2017; 25(1):87-111. PubMed ID: 26223000
    [TBL] [Abstract][Full Text] [Related]  

  • 29. Fast and parallel decomposition of constraint satisfaction problems.
    Gottlob G; Okulmus C; Pichler R
    Constraints; 2022; 27(3):284-326. PubMed ID: 35965950
    [TBL] [Abstract][Full Text] [Related]  

  • 30. Incremental social learning in particle swarms.
    de Oca MA; Stutzle T; Van den Enden K; Dorigo M
    IEEE Trans Syst Man Cybern B Cybern; 2011 Apr; 41(2):368-84. PubMed ID: 20875976
    [TBL] [Abstract][Full Text] [Related]  

  • 31. Dynamic algorithms for the shortest path routing problem: learning automata-based solutions.
    Misra S; Oommen BJ
    IEEE Trans Syst Man Cybern B Cybern; 2005 Dec; 35(6):1179-92. PubMed ID: 16366244
    [TBL] [Abstract][Full Text] [Related]  

  • 32. Using Stochastic Spiking Neural Networks on SpiNNaker to Solve Constraint Satisfaction Problems.
    Fonseca Guerra GA; Furber SB
    Front Neurosci; 2017; 11():714. PubMed ID: 29311791
    [TBL] [Abstract][Full Text] [Related]  

  • 33. Differential evolution with neighborhood and direction information for numerical optimization.
    Cai Y; Wang J
    IEEE Trans Cybern; 2013 Dec; 43(6):2202-15. PubMed ID: 23757529
    [TBL] [Abstract][Full Text] [Related]  

  • 34. An Evolutionary Algorithm with Double-Level Archives for Multiobjective Optimization.
    Chen N; Chen WN; Gong YJ; Zhan ZH; Zhang J; Li Y; Tan YS
    IEEE Trans Cybern; 2015 Sep; 45(9):1851-63. PubMed ID: 25343775
    [TBL] [Abstract][Full Text] [Related]  

  • 35. Robust alternative minimization for matrix completion.
    Lu X; Gong T; Yan P; Yuan Y; Li X
    IEEE Trans Syst Man Cybern B Cybern; 2012 Jun; 42(3):939-49. PubMed ID: 22345545
    [TBL] [Abstract][Full Text] [Related]  

  • 36. A product-driven system with an evolutionary algorithm to increase flexibility in planning a job shop.
    Sáez P; Herrera C; Booth C; Belmokhtar-Berraf S; Parada V
    PLoS One; 2023; 18(2):e0281807. PubMed ID: 36795712
    [TBL] [Abstract][Full Text] [Related]  

  • 37. Modeling the performance of evolutionary algorithms on the root identification problem: a case study with PBIL and CHC algorithms.
    Yeguas E; Joan-Arinyo R; Victoria Luz N MA
    Evol Comput; 2011; 19(1):107-35. PubMed ID: 20807079
    [TBL] [Abstract][Full Text] [Related]  

  • 38. Self-organizing potential field network: a new optimization algorithm.
    Xu L; Chow TW
    IEEE Trans Neural Netw; 2010 Sep; 21(9):1482-95. PubMed ID: 20570771
    [TBL] [Abstract][Full Text] [Related]  

  • 39. Multi-Objectivising Combinatorial Optimisation Problems by Means of Elementary Landscape Decompositions.
    Ceberio J; Calvo B; Mendiburu A; Lozano JA
    Evol Comput; 2019; 27(2):291-311. PubMed ID: 29446983
    [TBL] [Abstract][Full Text] [Related]  

  • 40. Theoretical and Empirical Analysis of a Spatial EA Parallel Boosting Algorithm.
    Kamath U; Domeniconi C; De Jong K
    Evol Comput; 2018; 26(1):43-66. PubMed ID: 27982696
    [TBL] [Abstract][Full Text] [Related]  

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