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 *

126 related articles for article (PubMed ID: 18021014)

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

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

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

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

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

  • 6. Toward a theory of evolutionary computation.
    Eberbach E
    Biosystems; 2005 Oct; 82(1):1-19. PubMed ID: 16102892
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 9. Local search with quadratic approximations into memetic algorithms for optimization with multiple criteria.
    Wanner EF; Guimarães FG; Takahashi RH; Fleming PJ
    Evol Comput; 2008; 16(2):185-224. PubMed ID: 18554100
    [TBL] [Abstract][Full Text] [Related]  

  • 10. On the hardness of offline multi-objective optimization.
    Teytaud O
    Evol Comput; 2007; 15(4):475-91. PubMed ID: 18021016
    [TBL] [Abstract][Full Text] [Related]  

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

  • 12. An information-theoretic analysis on the interactions of variables in combinatorial optimization problems.
    Seo DI; Moon BR
    Evol Comput; 2007; 15(2):169-98. PubMed ID: 17535138
    [TBL] [Abstract][Full Text] [Related]  

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

  • 14. LinMap: visualizing complexity gradients in evolutionary landscapes.
    Geard N; Wiles J
    Artif Life; 2008; 14(3):277-97. PubMed ID: 18489254
    [TBL] [Abstract][Full Text] [Related]  

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

  • 16. Approximate Counting of Graphical Realizations.
    Erdős PL; Kiss SZ; Miklós I; Soukup L
    PLoS One; 2015; 10(7):e0131300. PubMed ID: 26161994
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Objective reduction in evolutionary multiobjective optimization: theory and applications.
    Brockhoff D; Zitzler E
    Evol Comput; 2009; 17(2):135-66. PubMed ID: 19413486
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 20. Monte-Carlo sure: a black-box optimization of regularization parameters for general denoising algorithms.
    Ramani S; Blu T; Unser M
    IEEE Trans Image Process; 2008 Sep; 17(9):1540-54. PubMed ID: 18701393
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 7.