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 *

69 related articles for article (PubMed ID: 21815769)

  • 1. Motif difficulty (MD): a predictive measure of problem difficulty for evolutionary algorithms using network motifs.
    Liu J; Abbass HA; Green DG; Zhong W
    Evol Comput; 2012; 20(3):321-47. PubMed ID: 21815769
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

  • 5. Multidimensional knapsack problem: a fitness landscape analysis.
    Tavares J; Pereira FB; Costa E
    IEEE Trans Syst Man Cybern B Cybern; 2008 Jun; 38(3):604-16. PubMed ID: 18558527
    [TBL] [Abstract][Full Text] [Related]  

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

  • 7. Representations and evolutionary operators for the scheduling of pump operations in water distribution networks.
    López-Ibáñez M; Prasad TD; Paechter B
    Evol Comput; 2011; 19(3):429-67. PubMed ID: 21281118
    [TBL] [Abstract][Full Text] [Related]  

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

  • 9. Evolutionary artificial neural networks by multi-dimensional particle swarm optimization.
    Kiranyaz S; Ince T; Yildirim A; Gabbouj M
    Neural Netw; 2009 Dec; 22(10):1448-62. PubMed ID: 19556105
    [TBL] [Abstract][Full Text] [Related]  

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

  • 11. Estimating meme fitness in adaptive memetic algorithms for combinatorial problems.
    Smith JE
    Evol Comput; 2012; 20(2):165-88. PubMed ID: 22129225
    [TBL] [Abstract][Full Text] [Related]  

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

  • 13. Landscape Analysis of a Class of NP-Hard Binary Packing Problems.
    Alyahya K; Rowe JE
    Evol Comput; 2019; 27(1):47-73. PubMed ID: 30365387
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Do motifs reflect evolved function?--No convergent evolution of genetic regulatory network subgraph topologies.
    Knabe JF; Nehaniv CL; Schilstra MJ
    Biosystems; 2008; 94(1-2):68-74. PubMed ID: 18611431
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Geometrical recombination operators for real-coded evolutionary MCMCs.
    Drugan MM; Thierens D
    Evol Comput; 2010; 18(2):157-98. PubMed ID: 20210599
    [TBL] [Abstract][Full Text] [Related]  

  • 16. How evolutionary crystal structure prediction works--and why.
    Oganov AR; Lyakhov AO; Valle M
    Acc Chem Res; 2011 Mar; 44(3):227-37. PubMed ID: 21361336
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Models of performance of evolutionary program induction algorithms based on indicators of problem difficulty.
    Graff M; Poli R; Flores JJ
    Evol Comput; 2013; 21(4):533-60. PubMed ID: 23136918
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 20. iGibbs: improving Gibbs motif sampler for proteins by sequence clustering and iterative pattern sampling.
    Kim S; Wang Z; Dalkilic M
    Proteins; 2007 Feb; 66(3):671-81. PubMed ID: 17120229
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 4.