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 *

122 related articles for article (PubMed ID: 27243329)

  • 1. The Unrestricted Black-Box Complexity of Jump Functions.
    Buzdalov M; Doerr B; Kever M
    Evol Comput; 2016; 24(4):719-744. PubMed ID: 27243329
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Unbiased Black-Box Complexities of Jump Functions.
    Doerr B; Doerr C; Kötzing T
    Evol Comput; 2015; 23(4):641-70. PubMed ID: 26135718
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Introducing Elitist Black-Box Models: When Does Elitist Behavior Weaken the Performance of Evolutionary Algorithms?
    Doerr C; Lengler J
    Evol Comput; 2017; 25(4):587-606. PubMed ID: 27700278
    [TBL] [Abstract][Full Text] [Related]  

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

  • 5. Problem Features versus Algorithm Performance on Rugged Multiobjective Combinatorial Fitness Landscapes.
    Daolio F; Liefooghe A; Verel S; Aguirre H; Tanaka K
    Evol Comput; 2017; 25(4):555-585. PubMed ID: 27689467
    [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. A polynomial-time algorithm computing lower and upper bounds of the rooted subtree prune and regraft distance.
    Kannan L; Li H; Mushegian A
    J Comput Biol; 2011 May; 18(5):743-57. PubMed ID: 21166560
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Lower Bounds for Non-Elitist Evolutionary Algorithms via Negative Multiplicative Drift.
    Doerr B
    Evol Comput; 2021 Jun; 29(2):305-329. PubMed ID: 33197211
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Expected Fitness Gains of Randomized Search Heuristics for the Traveling Salesperson Problem.
    Nallaperuma S; Neumann F; Sudholt D
    Evol Comput; 2017; 25(4):673-705. PubMed ID: 27893278
    [TBL] [Abstract][Full Text] [Related]  

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

  • 11. Monotonicity of the ratio of modified Bessel functions of the first kind with applications.
    Yang ZH; Zheng SZ
    J Inequal Appl; 2018; 2018(1):57. PubMed ID: 29568211
    [TBL] [Abstract][Full Text] [Related]  

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

  • 13. Generating New Space-Filling Test Instances for Continuous Black-Box Optimization.
    Muñoz MA; Smith-Miles K
    Evol Comput; 2020; 28(3):379-404. PubMed ID: 31295020
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Greedy Hypervolume Subset Selection in Low Dimensions.
    Guerreiro AP; Fonseca CM; Paquete L
    Evol Comput; 2016; 24(3):521-44. PubMed ID: 27303786
    [TBL] [Abstract][Full Text] [Related]  

  • 15. How Many Subpopulations Is Too Many? Exponential Lower Bounds for Inferring Population Histories.
    Kim Y; Koehler F; Moitra A; Mossel E; Ramnarayan G
    J Comput Biol; 2020 Apr; 27(4):613-625. PubMed ID: 31794679
    [No Abstract]   [Full Text] [Related]  

  • 16. Energy complexity of recurrent neural networks.
    Síma J
    Neural Comput; 2014 May; 26(5):953-73. PubMed ID: 24555455
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Template based black-box optimization of dynamic neural fields.
    Fix J
    Neural Netw; 2013 Oct; 46():40-9. PubMed ID: 23692972
    [TBL] [Abstract][Full Text] [Related]  

  • 18. On the Performance of Different Genetic Programming Approaches for the SORTING Problem.
    Wagner M; Neumann F; Urli T
    Evol Comput; 2015; 23(4):583-609. PubMed ID: 25870929
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Maximizing Drift Is Not Optimal for Solving OneMax.
    Buskulic N; Doerr C
    Evol Comput; 2021 Dec; 29(4):521-541. PubMed ID: 33480820
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Robustness of Ant Colony Optimization to Noise.
    Friedrich T; Kötzing T; Krejca MS; Sutton AM
    Evol Comput; 2016; 24(2):237-54. PubMed ID: 26928850
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 7.