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 *

217 related articles for article (PubMed ID: 18386998)

  • 1. On complexity of optimal recombination for binary representations of solutions.
    Eremeev AV
    Evol Comput; 2008; 16(1):127-47. PubMed ID: 18386998
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 4. An "optimal" k-needle placement strategy and its application to guiding transbronchial needle aspirations.
    Kukuk M
    Comput Aided Surg; 2004; 9(6):261-90. PubMed ID: 16112977
    [TBL] [Abstract][Full Text] [Related]  

  • 5. Introducing robustness in multi-objective optimization.
    Deb K; Gupta H
    Evol Comput; 2006; 14(4):463-94. PubMed ID: 17109607
    [TBL] [Abstract][Full Text] [Related]  

  • 6. Optimal combination of nested clusters by a greedy approximation algorithm.
    Dang EK; Luk RW; Lee DL; Ho KS; Chan SC
    IEEE Trans Pattern Anal Mach Intell; 2009 Nov; 31(11):2083-7. PubMed ID: 19762933
    [TBL] [Abstract][Full Text] [Related]  

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

  • 8. An efficient and accurate solution methodology for bilevel multi-objective programming problems using a hybrid evolutionary-local-search algorithm.
    Deb K; Sinha A
    Evol Comput; 2010; 18(3):403-49. PubMed ID: 20560758
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Chemical genetic algorithms--evolutionary optimization of binary-to-real-value translation in genetic algorithms.
    Suzuki H; Sawai H; Piaseczny W
    Artif Life; 2006; 12(1):89-115. PubMed ID: 16393452
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Modeling and efficient optimization for object-based scalability and some related problems.
    Batra P
    IEEE Trans Image Process; 2000; 9(10):1677-92. PubMed ID: 18262907
    [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. Evaluating the epsilon-domination based multi-objective evolutionary algorithm for a quick computation of Pareto-optimal solutions.
    Deb K; Mohan M; Mishra S
    Evol Comput; 2005; 13(4):501-25. PubMed ID: 16297281
    [TBL] [Abstract][Full Text] [Related]  

  • 13. The generalized quadratic knapsack problem. A neuronal network approach.
    Talaván PM; Yáñez J
    Neural Netw; 2006 May; 19(4):416-28. PubMed ID: 16488117
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Sign-representation of Boolean functions using a small number of monomials.
    Oztop E
    Neural Netw; 2009 Sep; 22(7):938-48. PubMed ID: 19423284
    [TBL] [Abstract][Full Text] [Related]  

  • 15. A new evolutionary algorithm for solving many-objective optimization problems.
    Zou X; Chen Y; Liu M; Kang L
    IEEE Trans Syst Man Cybern B Cybern; 2008 Oct; 38(5):1402-12. PubMed ID: 18784020
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Self-adaptation of mutation operator and probability for permutation representations in genetic algorithms.
    Serpell M; Smith JE
    Evol Comput; 2010; 18(3):491-514. PubMed ID: 20560757
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Constructive genetic algorithm for clustering problems.
    Lorena LA; Furtado JC
    Evol Comput; 2001; 9(3):309-27. PubMed ID: 11522209
    [TBL] [Abstract][Full Text] [Related]  

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

  • 19. Multiple Choice Knapsack Problem: example of planning choice in transportation.
    Zhong T; Young R
    Eval Program Plann; 2010 May; 33(2):128-37. PubMed ID: 19596437
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Redundant representations in evolutionary computation.
    Rothlauf F; Goldberg DE
    Evol Comput; 2003; 11(4):381-415. PubMed ID: 14629864
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 11.