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 *

128 related articles for article (PubMed ID: 25222964)

  • 1. Approximation and Parameterized Runtime Analysis of Evolutionary Algorithms for the Maximum Cut Problem.
    Zhou Y; Lai X; Li K
    IEEE Trans Cybern; 2015 Aug; 45(8):1491-8. PubMed ID: 25222964
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Performance Analysis of Evolutionary Algorithms for Steiner Tree Problems.
    Lai X; Zhou Y; Xia X; Zhang Q
    Evol Comput; 2017; 25(4):707-723. PubMed ID: 27959580
    [TBL] [Abstract][Full Text] [Related]  

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

  • 4. Maximizing Submodular Functions under Matroid Constraints by Evolutionary Algorithms.
    Friedrich T; Neumann F
    Evol Comput; 2015; 23(4):543-58. PubMed ID: 26135719
    [TBL] [Abstract][Full Text] [Related]  

  • 5. Runtime analysis of the (mu+1) EA on simple Pseudo-Boolean functions.
    Witt C
    Evol Comput; 2006; 14(1):65-86. PubMed ID: 16536891
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 8. Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs.
    Novotná J; Okrasa K; Pilipczuk M; Rzążewski P; van Leeuwen EJ; Walczak B
    Algorithmica; 2021; 83(8):2634-2650. PubMed ID: 34720297
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Bioinspired Quantum Oracle Circuits for Biomolecular Solutions of the Maximum Cut Problem.
    Chang WL; Wong R; Chen YH; Chung WY; Chen JC; Vasilakos AV
    IEEE Trans Nanobioscience; 2024 Jul; 23(3):499-506. PubMed ID: 38687648
    [TBL] [Abstract][Full Text] [Related]  

  • 10. A Simple Algorithm for Finding All k-Edge-Connected Components.
    Wang T; Zhang Y; Chin FY; Ting HF; Tsin YH; Poon SH
    PLoS One; 2015; 10(9):e0136264. PubMed ID: 26368134
    [TBL] [Abstract][Full Text] [Related]  

  • 11. A comparative runtime analysis of heuristic algorithms for satisfiability problems.
    Zhou Y; He J; Nie Q
    Artif Intell; 2009 Feb; 173(2):240-257. PubMed ID: 20126510
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Tight analysis of the (1+1)-EA for the single source shortest path problem.
    Doerr B; Happ E; Klein C
    Evol Comput; 2011; 19(4):673-91. PubMed ID: 21838552
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Finding Mount Everest and handling voids.
    Storch T
    Evol Comput; 2011; 19(2):325-44. PubMed ID: 21073298
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Parameterized Analysis of Multiobjective Evolutionary Algorithms and the Weighted Vertex Cover Problem.
    Pourhassan M; Shi F; Neumann F
    Evol Comput; 2019; 27(4):559-575. PubMed ID: 31012735
    [TBL] [Abstract][Full Text] [Related]  

  • 15. On the choice of the parent population size.
    Storch T
    Evol Comput; 2008; 16(4):557-78. PubMed ID: 19053499
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Complexity of Secure Sets.
    Bliem B; Woltran S
    Algorithmica; 2018; 80(10):2909-2940. PubMed ID: 29937611
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Quantum Speedup and Mathematical Solutions of Implementing Bio-Molecular Solutions for the Independent Set Problem on IBM Quantum Computers.
    Chang WL; Chen JC; Chung WY; Hsiao CY; Wong R; Vasilakos AV
    IEEE Trans Nanobioscience; 2021 Jul; 20(3):354-376. PubMed ID: 33900920
    [TBL] [Abstract][Full Text] [Related]  

  • 18. On the choice of the offspring population size in evolutionary algorithms.
    Jansen T; De Jong KA; Wegener I
    Evol Comput; 2005; 13(4):413-40. PubMed ID: 16297278
    [TBL] [Abstract][Full Text] [Related]  

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

  • 20. A new approach to population sizing for memetic algorithms: a case study for the multidimensional assignment problem.
    Karapetyan D; Gutin G
    Evol Comput; 2011; 19(3):345-71. PubMed ID: 20868263
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 7.