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 *

193 related articles for article (PubMed ID: 20560760)

  • 21. Speeding up evolutionary algorithms through asymmetric mutation operators.
    Doerr B; Hebbinghaus N; Neumann F
    Evol Comput; 2007; 15(4):401-10. PubMed ID: 18021012
    [TBL] [Abstract][Full Text] [Related]  

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

  • 23. Optimizing phylogenetic diversity under constraints.
    Moulton V; Semple C; Steel M
    J Theor Biol; 2007 May; 246(1):186-94. PubMed ID: 17275037
    [TBL] [Abstract][Full Text] [Related]  

  • 24. Fast marching methods for the continuous traveling salesman problem.
    Andrews J; Sethian JA
    Proc Natl Acad Sci U S A; 2007 Jan; 104(4):1118-23. PubMed ID: 17220271
    [TBL] [Abstract][Full Text] [Related]  

  • 25. On Proportions of Fit Individuals in Population of Mutation-Based Evolutionary Algorithm with Tournament Selection.
    Eremeev AV
    Evol Comput; 2018; 26(2):269-297. PubMed ID: 28489414
    [TBL] [Abstract][Full Text] [Related]  

  • 26. A multiagent evolutionary algorithm for combinatorial optimization problems.
    Liu J; Zhong W; Jiao L
    IEEE Trans Syst Man Cybern B Cybern; 2010 Feb; 40(1):229-40. PubMed ID: 19643707
    [TBL] [Abstract][Full Text] [Related]  

  • 27. On the use of multi-objective evolutionary algorithms for survival analysis.
    Setzkorn C; Taktak AF; Damato BE
    Biosystems; 2007 Jan; 87(1):31-48. PubMed ID: 16762491
    [TBL] [Abstract][Full Text] [Related]  

  • 28. Approximating covering problems by randomized search heuristics using multi-objective models.
    Friedrich T; He J; Hebbinghaus N; Neumann F; Witt C
    Evol Comput; 2010; 18(4):617-33. PubMed ID: 20583912
    [TBL] [Abstract][Full Text] [Related]  

  • 29. The hierarchical fair competition (HFC) framework for sustainable evolutionary algorithms.
    Hu J; Goodman E; Seo K; Fan Z; Rosenberg R
    Evol Comput; 2005; 13(2):241-77. PubMed ID: 15969902
    [TBL] [Abstract][Full Text] [Related]  

  • 30. A monotonic archive for pareto-coevolution.
    de Jong ED
    Evol Comput; 2007; 15(1):61-93. PubMed ID: 17388779
    [TBL] [Abstract][Full Text] [Related]  

  • 31. On the use of multi-objective evolutionary algorithms for the induction of fuzzy classification rule systems.
    Setzkorn C; Paton RC
    Biosystems; 2005 Aug; 81(2):101-12. PubMed ID: 15939532
    [TBL] [Abstract][Full Text] [Related]  

  • 32. Empirical analysis of locality, heritability and heuristic bias in evolutionary algorithms: a case study for the multidimensional knapsack problem.
    Raidl GR; Gottlieb J
    Evol Comput; 2005; 13(4):441-75. PubMed ID: 16297279
    [TBL] [Abstract][Full Text] [Related]  

  • 33. Local search with quadratic approximations into memetic algorithms for optimization with multiple criteria.
    Wanner EF; Guimarães FG; Takahashi RH; Fleming PJ
    Evol Comput; 2008; 16(2):185-224. PubMed ID: 18554100
    [TBL] [Abstract][Full Text] [Related]  

  • 34. Toward a theory of evolutionary computation.
    Eberbach E
    Biosystems; 2005 Oct; 82(1):1-19. PubMed ID: 16102892
    [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. Automatic generation of controllers for embodied legged organisms: a Pareto evolutionary multi-objective approach.
    Teo J; Abbass HA
    Evol Comput; 2004; 12(3):355-94. PubMed ID: 15355605
    [TBL] [Abstract][Full Text] [Related]  

  • 37. Approximation and Parameterized Runtime Analysis of Evolutionary Algorithms for the Maximum Cut Problem.
    Zhou Y; Lai X; Li K
    IEEE Trans Cybern; 2015 Aug; 45(8):1491-8. PubMed ID: 25222964
    [TBL] [Abstract][Full Text] [Related]  

  • 38. Spin-flip symmetry and synchronization.
    Van Hoyweghen C; Naudts B; Goldberg DE
    Evol Comput; 2002; 10(4):317-44. PubMed ID: 12450454
    [TBL] [Abstract][Full Text] [Related]  

  • 39. An efficient algorithm for computing hypervolume contributions.
    Bringmann K; Friedrich T
    Evol Comput; 2010; 18(3):383-402. PubMed ID: 20560759
    [TBL] [Abstract][Full Text] [Related]  

  • 40. A note on problem difficulty measures in black-box optimization: classification, realizations and predictability.
    He J; Reeves C; Witt C; Yao X
    Evol Comput; 2007; 15(4):435-43. PubMed ID: 18021014
    [TBL] [Abstract][Full Text] [Related]  

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