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 *

159 related articles for article (PubMed ID: 20126510)

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

  • 2. Applying aspiration in local search for satisfiability.
    Peng C; Xu Z; Mei M
    PLoS One; 2020; 15(4):e0231702. PubMed ID: 32324765
    [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. Algorithm for finding partitionings of hard variants of boolean satisfiability problem with application to inversion of some cryptographic functions.
    Semenov A; Zaikin O
    Springerplus; 2016; 5():554. PubMed ID: 27190753
    [TBL] [Abstract][Full Text] [Related]  

  • 5. Theoretical Analyses of Multiobjective Evolutionary Algorithms on Multimodal Objectives.
    Zheng W; Doerr B
    Evol Comput; 2023 Dec; 31(4):337-373. PubMed ID: 37023353
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 8. Exponentially hard problems are sometimes polynomial, a large deviation analysis of search algorithms for the random satisfiability problem, and its application to stop-and-restart resolutions.
    Cocco S; Monasson R
    Phys Rev E Stat Nonlin Soft Matter Phys; 2002 Sep; 66(3 Pt 2B):037101. PubMed ID: 12366297
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Behavior of heuristics on large and hard satisfiability problems.
    Ardelius J; Aurell E
    Phys Rev E Stat Nonlin Soft Matter Phys; 2006 Sep; 74(3 Pt 2):037702. PubMed ID: 17025790
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Satisfiability-unsatisfiability transition in the adversarial satisfiability problem.
    Bardoscia M; Nagaj D; Scardicchio A
    Phys Rev E Stat Nonlin Soft Matter Phys; 2014 Mar; 89(3):032128. PubMed ID: 24730811
    [TBL] [Abstract][Full Text] [Related]  

  • 11. The backtracking survey propagation algorithm for solving random K-SAT problems.
    Marino R; Parisi G; Ricci-Tersenghi F
    Nat Commun; 2016 Oct; 7():12996. PubMed ID: 27694952
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Circumspect descent prevails in solving random constraint satisfaction problems.
    Alava M; Ardelius J; Aurell E; Kaski P; Krishnamurthy S; Orponen P; Seitz S
    Proc Natl Acad Sci U S A; 2008 Oct; 105(40):15253-7. PubMed ID: 18832149
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Symmetry Breaking for Voting Mechanisms.
    Sankineni P; Sutton AM
    Evol Comput; 2023 Sep; 31(3):309-335. PubMed ID: 37023361
    [TBL] [Abstract][Full Text] [Related]  

  • 14. An Analytical Framework for Runtime of a Class of Continuous Evolutionary Algorithms.
    Zhang Y; Hu G
    Comput Intell Neurosci; 2015; 2015():485215. PubMed ID: 26366166
    [TBL] [Abstract][Full Text] [Related]  

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

  • 16. Proving sequence aligners can guarantee accuracy in almost
    Shaw J; Yu YW
    Genome Res; 2023 Jul; 33(7):1175-1187. PubMed ID: 36990779
    [TBL] [Abstract][Full Text] [Related]  

  • 17. The k partition-distance problem.
    Chen YH
    J Comput Biol; 2012 Apr; 19(4):404-17. PubMed ID: 22468708
    [TBL] [Abstract][Full Text] [Related]  

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

  • 19. Quantum verification of NP problems with single photons and linear optics.
    Zhang A; Zhan H; Liao J; Zheng K; Jiang T; Mi M; Yao P; Zhang L
    Light Sci Appl; 2021 Aug; 10(1):169. PubMed ID: 34408129
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Efficient solution of Boolean satisfiability problems with digital memcomputing.
    Bearden SRB; Pei YR; Di Ventra M
    Sci Rep; 2020 Nov; 10(1):19741. PubMed ID: 33184386
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 8.