BIOMARKERS

Molecular Biopsy of Human Tumors

- a resource for Precision Medicine *

317 related articles for article (PubMed ID: 12804094)

  • 1. Reducing the time complexity of the derandomized evolution strategy with covariance matrix adaptation (CMA-ES).
    Hansen N; Müller SD; Koumoutsakos P
    Evol Comput; 2003; 11(1):1-18. PubMed ID: 12804094
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Covariance matrix adaptation for multi-objective optimization.
    Igel C; Hansen N; Roth S
    Evol Comput; 2007; 15(1):1-28. PubMed ID: 17388777
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Completely derandomized self-adaptation in evolution strategies.
    Hansen N; Ostermeier A
    Evol Comput; 2001; 9(2):159-95. PubMed ID: 11382355
    [TBL] [Abstract][Full Text] [Related]  

  • 4. A computationally efficient evolutionary algorithm for real-parameter optimization.
    Deb K; Anand A; Joshi D
    Evol Comput; 2002; 10(4):371-95. PubMed ID: 12450456
    [TBL] [Abstract][Full Text] [Related]  

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

  • 6. LM-CMA: An Alternative to L-BFGS for Large-Scale Black Box Optimization.
    Loshchilov I
    Evol Comput; 2017; 25(1):143-171. PubMed ID: 26426070
    [TBL] [Abstract][Full Text] [Related]  

  • 7. Diagonal Acceleration for Covariance Matrix Adaptation Evolution Strategies.
    Akimoto Y; Hansen N
    Evol Comput; 2020; 28(3):405-435. PubMed ID: 31120772
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Convergence in evolutionary programs with self-adaptation.
    Greenwood GW; Zhu QJ
    Evol Comput; 2001; 9(2):147-57. PubMed ID: 11382354
    [TBL] [Abstract][Full Text] [Related]  

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

  • 10. Self-adaptive genetic algorithms with simulated binary crossover.
    Deb K; Beyer HG
    Evol Comput; 2001; 9(2):197-221. PubMed ID: 11382356
    [TBL] [Abstract][Full Text] [Related]  

  • 11. A novel parallel algorithm for large-scale Fock matrix construction with small locally distributed memory architectures: RT parallel algorithm.
    Takashima H; Yamada S; Obara S; Kitamura K; Inabata S; Miyakawa N; Tanabe K; Nagashima U
    J Comput Chem; 2002 Nov; 23(14):1337-46. PubMed ID: 12214316
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Adaptive cellular memetic algorithms.
    Huy NQ; Soon OY; Hiot LM; Krasnogor N
    Evol Comput; 2009; 17(2):231-56. PubMed ID: 19413489
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 15. Combining convergence and diversity in evolutionary multiobjective optimization.
    Laumanns M; Thiele L; Deb K; Zitzler E
    Evol Comput; 2002; 10(3):263-82. PubMed ID: 12227996
    [TBL] [Abstract][Full Text] [Related]  

  • 16. On the benefits of populations for noisy optimization.
    Arnold DV; Beyer HG
    Evol Comput; 2003; 11(2):111-27. PubMed ID: 12875665
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Fast Covariance Matrix Adaptation for Large-Scale Black-Box Optimization.
    Li Z; Zhang Q; Lin X; Zhen HL
    IEEE Trans Cybern; 2020 May; 50(5):2073-2083. PubMed ID: 30442627
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Qualms regarding the optimality of cumulative path length control in CSA/CMA-evolution strategies.
    Beyer HG; Arnold DV
    Evol Comput; 2003; 11(1):19-28. PubMed ID: 12804095
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Development of methods for beam angle optimization for IMRT using an accelerated exhaustive search strategy.
    Wang X; Zhang X; Dong L; Liu H; Wu Q; Mohan R
    Int J Radiat Oncol Biol Phys; 2004 Nov; 60(4):1325-37. PubMed ID: 15519806
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Design of zero reference codes using cross-entropy method.
    Chen JC
    Opt Express; 2009 Nov; 17(24):22163-70. PubMed ID: 19997462
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 16.