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 *

196 related articles for article (PubMed ID: 18558527)

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

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

  • 4. On the suitability of different representations of solid catalysts for combinatorial library design by genetic algorithms.
    Gobin OC; Schüth F
    J Comb Chem; 2008; 10(6):835-46. PubMed ID: 18693763
    [TBL] [Abstract][Full Text] [Related]  

  • 5. Fitness landscapes, memetic algorithms, and greedy operators for graph bipartitioning.
    Merz P; Freisleben B
    Evol Comput; 2000; 8(1):61-91. PubMed ID: 10753231
    [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. A study of fitness distance correlation as a difficulty measure in genetic programming.
    Tomassini M; Vanneschi L; Collard P; Clergue M
    Evol Comput; 2005; 13(2):213-39. PubMed ID: 15969901
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Fitness Probability Distribution of Bit-Flip Mutation.
    Chicano F; Sutton AM; Whitley LD; Alba E
    Evol Comput; 2015; 23(2):217-48. PubMed ID: 24885680
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Analyses of simple hybrid algorithms for the vertex cover problem.
    Friedrich T; He J; Hebbinghaus N; Neumann F; Witt C
    Evol Comput; 2009; 17(1):3-19. PubMed ID: 19207086
    [TBL] [Abstract][Full Text] [Related]  

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

  • 11. Tracking moving optima using Kalman-based predictions.
    Rossi C; Abderrahim M; Díaz JC
    Evol Comput; 2008; 16(1):1-30. PubMed ID: 18386994
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Score-based resampling method for evolutionary algorithms.
    Park J; Jeon M; Pedrycz W
    IEEE Trans Syst Man Cybern B Cybern; 2008 Oct; 38(5):1347-55. PubMed ID: 18784016
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Automated discovery of local search heuristics for satisfiability testing.
    Fukunaga AS
    Evol Comput; 2008; 16(1):31-61. PubMed ID: 18386995
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Representation invariant genetic operators.
    Rowe JE; Vose MD; Wright AH
    Evol Comput; 2010; 18(4):635-60. PubMed ID: 20583908
    [TBL] [Abstract][Full Text] [Related]  

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

  • 16. A note on Lewicki-Sejnowski gradient for learning overcomplete representations.
    He Z; Xie S; Zhang L; Cichocki A
    Neural Comput; 2008 Mar; 20(3):636-43. PubMed ID: 18047437
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Hybrid particle swarm optimization with wavelet mutation and its industrial applications.
    Ling SH; Iu HH; Chan KY; Lam HK; Yeung BC; Leung FH
    IEEE Trans Syst Man Cybern B Cybern; 2008 Jun; 38(3):743-63. PubMed ID: 18558539
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Genetic programming over context-free languages with linear constraints for the knapsack problem: first results.
    Bruhn P; Geyer-Schulz A
    Evol Comput; 2002; 10(1):51-74. PubMed ID: 11928691
    [TBL] [Abstract][Full Text] [Related]  

  • 19. A Case Study of Controlling Crossover in a Selection Hyper-heuristic Framework Using the Multidimensional Knapsack Problem.
    Drake JH; Özcan E; Burke EK
    Evol Comput; 2016; 24(1):113-41. PubMed ID: 25635698
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Automated design of image operators that detect interest points.
    Trujillo L; Olague G
    Evol Comput; 2008; 16(4):483-507. PubMed ID: 19053496
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 10.