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 *

87 related articles for article (PubMed ID: 21073298)

  • 1. Finding Mount Everest and handling voids.
    Storch T
    Evol Comput; 2011; 19(2):325-44. PubMed ID: 21073298
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Runtime analysis of the (mu+1) EA on simple Pseudo-Boolean functions.
    Witt C
    Evol Comput; 2006; 14(1):65-86. PubMed ID: 16536891
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Analysis of an asymmetric mutation operator.
    Jansen T; Sudholt D
    Evol Comput; 2010; 18(1):1-26. PubMed ID: 20064023
    [TBL] [Abstract][Full Text] [Related]  

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

  • 5. A new approach for analyzing average time complexity of population-based evolutionary algorithms on unimodal problems.
    Chen T; He J; Sun G; Chen G; Yao X
    IEEE Trans Syst Man Cybern B Cybern; 2009 Oct; 39(5):1092-106. PubMed ID: 19336324
    [TBL] [Abstract][Full Text] [Related]  

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

  • 7. An impatient evolutionary algorithm with probabilistic tabu search for unified solution of some NP-hard problems in graph and set theory via clique finding.
    Guturu P; Dantu R
    IEEE Trans Syst Man Cybern B Cybern; 2008 Jun; 38(3):645-66. PubMed ID: 18558530
    [TBL] [Abstract][Full Text] [Related]  

  • 8. On the choice of the offspring population size in evolutionary algorithms.
    Jansen T; De Jong KA; Wegener I
    Evol Comput; 2005; 13(4):413-40. PubMed ID: 16297278
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Analysis of (1+1) evolutionary algorithm and randomized local search with memory.
    Sung CW; Yuen SY
    Evol Comput; 2011; 19(2):287-323. PubMed ID: 20868262
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Solving the multiple competitive facilities location and design problem on the plane.
    Redondo JL; Fernández J; García I; Ortigosa PM
    Evol Comput; 2009; 17(1):21-53. PubMed ID: 19207087
    [TBL] [Abstract][Full Text] [Related]  

  • 11. A new approach to population sizing for memetic algorithms: a case study for the multidimensional assignment problem.
    Karapetyan D; Gutin G
    Evol Comput; 2011; 19(3):345-71. PubMed ID: 20868263
    [TBL] [Abstract][Full Text] [Related]  

  • 12. A dynamic nuclear polarization strategy for multi-dimensional Earth's field NMR spectroscopy.
    Halse ME; Callaghan PT
    J Magn Reson; 2008 Dec; 195(2):162-8. PubMed ID: 18926746
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Strength Pareto particle swarm optimization and hybrid EA-PSO for multi-objective optimization.
    Elhossini A; Areibi S; Dony R
    Evol Comput; 2010; 18(1):127-56. PubMed ID: 20064026
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

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

  • 18. Exploring the runtime of an evolutionary algorithm for the multi-objective shortest path problem.
    Horoba C
    Evol Comput; 2010; 18(3):357-81. PubMed ID: 20560760
    [TBL] [Abstract][Full Text] [Related]  

  • 19. An intelligent multi-restart memetic algorithm for box constrained global optimisation.
    Sun J; Garibaldi JM; Krasnogor N; Zhang Q
    Evol Comput; 2013; 21(1):107-47. PubMed ID: 22335546
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Memetic algorithms for continuous optimisation based on local search chains.
    Molina D; Lozano M; García-Martínez C; Herrera F
    Evol Comput; 2010; 18(1):27-63. PubMed ID: 20064025
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 5.