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 *

114 related articles for article (PubMed ID: 25177732)

  • 1. A variable neighborhood Walksat-based algorithm for MAX-SAT problems.
    Bouhmala N
    ScientificWorldJournal; 2014; 2014():798323. PubMed ID: 25177732
    [TBL] [Abstract][Full Text] [Related]  

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

  • 3. Quantum Algorithm for Variant Maximum Satisfiability.
    Alasow A; Jin P; Perkowski M
    Entropy (Basel); 2022 Nov; 24(11):. PubMed ID: 36359704
    [TBL] [Abstract][Full Text] [Related]  

  • 4. A multilevel memetic algorithm for large SAT-encoded problems.
    Bouhmala N
    Evol Comput; 2012; 20(4):641-64. PubMed ID: 22540191
    [TBL] [Abstract][Full Text] [Related]  

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

  • 6. From one solution of a 3-satisfiability formula to a solution cluster: frozen variables and entropy.
    Li K; Ma H; Zhou H
    Phys Rev E Stat Nonlin Soft Matter Phys; 2009 Mar; 79(3 Pt 1):031102. PubMed ID: 19391897
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

  • 11. A Structural Entropy Measurement Principle of Propositional Formulas in Conjunctive Normal Form.
    Zhang Z; Xu D; Zhou J
    Entropy (Basel); 2021 Mar; 23(3):. PubMed ID: 33806451
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Local search methods based on variable focusing for random K-satisfiability.
    Lemoy R; Alava M; Aurell E
    Phys Rev E Stat Nonlin Soft Matter Phys; 2015 Jan; 91(1):013305. PubMed ID: 25679737
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Solving the SAT problem using a DNA computing algorithm based on ligase chain reaction.
    Wang X; Bao Z; Hu J; Wang S; Zhan A
    Biosystems; 2008 Jan; 91(1):117-25. PubMed ID: 17904730
    [TBL] [Abstract][Full Text] [Related]  

  • 14. A Direct Mapping of Max k-SAT and High Order Parity Checks to a Chimera Graph.
    Chancellor N; Zohren S; Warburton PA; Benjamin SC; Roberts S
    Sci Rep; 2016 Nov; 6():37107. PubMed ID: 27857179
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Phase transitions of the typical algorithmic complexity of the random satisfiability problem studied with linear programming.
    Schawe H; Bleim R; Hartmann AK
    PLoS One; 2019; 14(4):e0215309. PubMed ID: 31002678
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Factoring semi-primes with (quantum) SAT-solvers.
    Mosca M; Verschoor SR
    Sci Rep; 2022 May; 12(1):7982. PubMed ID: 35568707
    [TBL] [Abstract][Full Text] [Related]  

  • 17. On speeding up factoring with quantum SAT solvers.
    Mosca M; Basso JMV; Verschoor SR
    Sci Rep; 2020 Sep; 10(1):15022. PubMed ID: 32929125
    [TBL] [Abstract][Full Text] [Related]  

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

  • 19. Analytic and algorithmic solution of random satisfiability problems.
    Mézard M; Parisi G; Zecchina R
    Science; 2002 Aug; 297(5582):812-5. PubMed ID: 12089451
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Random K-satisfiability problem: from an analytic solution to an efficient algorithm.
    Mézard M; Zecchina R
    Phys Rev E Stat Nonlin Soft Matter Phys; 2002 Nov; 66(5 Pt 2):056126. PubMed ID: 12513575
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 6.