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 *

154 related articles for article (PubMed ID: 20064023)

  • 21. Advanced fitness landscape analysis and the performance of memetic algorithms.
    Merz P
    Evol Comput; 2004; 12(3):303-25. PubMed ID: 15355603
    [TBL] [Abstract][Full Text] [Related]  

  • 22. Self-organized modularization in evolutionary algorithms.
    Dauscher P; Uthmann T
    Evol Comput; 2005; 13(3):303-28. PubMed ID: 16156926
    [TBL] [Abstract][Full Text] [Related]  

  • 23. Memetic algorithms for the unconstrained binary quadratic programming problem.
    Merz P; Katayama K
    Biosystems; 2004 Dec; 78(1-3):99-118. PubMed ID: 15555762
    [TBL] [Abstract][Full Text] [Related]  

  • 24. General upper bounds on the runtime of parallel evolutionary algorithms.
    Lässig J; Sudholt D
    Evol Comput; 2014; 22(3):405-37. PubMed ID: 24195490
    [TBL] [Abstract][Full Text] [Related]  

  • 25. Automatic Combination of Operators in a Genetic Algorithm to Solve the Traveling Salesman Problem.
    Contreras-Bolton C; Parada V
    PLoS One; 2015; 10(9):e0137724. PubMed ID: 26367182
    [TBL] [Abstract][Full Text] [Related]  

  • 26. On the choice of the parent population size.
    Storch T
    Evol Comput; 2008; 16(4):557-78. PubMed ID: 19053499
    [TBL] [Abstract][Full Text] [Related]  

  • 27. Analysis of diversity-preserving mechanisms for global exploration.
    Friedrich T; Oliveto PS; Sudholt D; Witt C
    Evol Comput; 2009; 17(4):455-76. PubMed ID: 19916783
    [TBL] [Abstract][Full Text] [Related]  

  • 28. Analyses of simple hybrid algorithms for the vertex cover problem.
    Friedrich T; He J; Hebbinghaus N; Neumann F; Witt C
    Evol Comput; 2009; 17(1):3-19. PubMed ID: 19207086
    [TBL] [Abstract][Full Text] [Related]  

  • 29. Adaptive niche radii and niche shapes approaches for niching with the CMA-ES.
    Shir OM; Emmerich M; Bäck T
    Evol Comput; 2010; 18(1):97-126. PubMed ID: 20064027
    [TBL] [Abstract][Full Text] [Related]  

  • 30. Fitness landscapes, memetic algorithms, and greedy operators for graph bipartitioning.
    Merz P; Freisleben B
    Evol Comput; 2000; 8(1):61-91. PubMed ID: 10753231
    [TBL] [Abstract][Full Text] [Related]  

  • 31. Efficient and scalable Pareto optimization by evolutionary local selection algorithms.
    Menczer F; Degeratu M; Street WN
    Evol Comput; 2000; 8(2):223-47. PubMed ID: 10843522
    [TBL] [Abstract][Full Text] [Related]  

  • 32. Representation invariant genetic operators.
    Rowe JE; Vose MD; Wright AH
    Evol Comput; 2010; 18(4):635-60. PubMed ID: 20583908
    [TBL] [Abstract][Full Text] [Related]  

  • 33. The effectiveness of mutation operation in the case of Estimation of Distribution Algorithms.
    Handa H
    Biosystems; 2007 Feb; 87(2-3):243-51. PubMed ID: 17046150
    [TBL] [Abstract][Full Text] [Related]  

  • 34. Picbreeder: a case study in collaborative evolutionary exploration of design space.
    Secretan J; Beato N; D'Ambrosio DB; Rodriguez A; Campbell A; Folsom-Kovarik JT; Stanley KO
    Evol Comput; 2011; 19(3):373-403. PubMed ID: 20964537
    [TBL] [Abstract][Full Text] [Related]  

  • 35. Parameterized runtime analyses of evolutionary algorithms for the planar euclidean traveling salesperson problem.
    Sutton AM; Neumann F; Nallaperuma S
    Evol Comput; 2014; 22(4):595-628. PubMed ID: 24479542
    [TBL] [Abstract][Full Text] [Related]  

  • 36. Comparison-based algorithms are robust and randomized algorithms are anytime.
    Gelly S; Ruette S; Teytaud O
    Evol Comput; 2007; 15(4):411-34. PubMed ID: 18021013
    [TBL] [Abstract][Full Text] [Related]  

  • 37. Adaptive linkage crossover.
    Salman AA; Mehrotra K; Mohan CK
    Evol Comput; 2000; 8(3):341-70. PubMed ID: 11001555
    [TBL] [Abstract][Full Text] [Related]  

  • 38. Fitting Lorentzian peaks with evolutionary genetic algorithm based on stochastic search procedure.
    Karakaplan M
    Anal Chim Acta; 2007 Mar; 587(2):235-9. PubMed ID: 17386778
    [TBL] [Abstract][Full Text] [Related]  

  • 39. Design of graph-based evolutionary algorithms: a case study for chemical process networks.
    Emmerich M; Grötzner M; Schütz M
    Evol Comput; 2001; 9(3):329-54. PubMed ID: 11522210
    [TBL] [Abstract][Full Text] [Related]  

  • 40. Evolutionary algorithms for the satisfiability problem.
    Gottlieb J; Marchiori E; Rossi C
    Evol Comput; 2002; 10(1):35-50. PubMed ID: 11911782
    [TBL] [Abstract][Full Text] [Related]  

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