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 *

162 related articles for article (PubMed ID: 32324765)

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

  • 2. Clause states based configuration checking in local search for satisfiability.
    Luo C; Cai S; Su K; Wu W
    IEEE Trans Cybern; 2015 May; 45(5):1014-27. PubMed ID: 25134096
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

  • 7. Augmenting an electronic Ising machine to effectively solve boolean satisfiability.
    Sharma A; Burns M; Hahn A; Huang M
    Sci Rep; 2023 Dec; 13(1):22858. PubMed ID: 38129549
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Predicting the satisfiability of Boolean formulas by incorporating gated recurrent unit (GRU) in the Transformer framework.
    Chang W; Guo M; Luo J
    PeerJ Comput Sci; 2024; 10():e2169. PubMed ID: 39145235
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Numerical solution-space analysis of satisfiability problems.
    Mann A; Hartmann AK
    Phys Rev E Stat Nonlin Soft Matter Phys; 2010 Nov; 82(5 Pt 2):056702. PubMed ID: 21230614
    [TBL] [Abstract][Full Text] [Related]  

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

  • 11. Using Stochastic Spiking Neural Networks on SpiNNaker to Solve Constraint Satisfaction Problems.
    Fonseca Guerra GA; Furber SB
    Front Neurosci; 2017; 11():714. PubMed ID: 29311791
    [TBL] [Abstract][Full Text] [Related]  

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

  • 13. G2SAT: Learning to Generate SAT Formulas.
    You J; Wu H; Barrett C; Ramanujan R; Leskovec J
    Adv Neural Inf Process Syst; 2019 Dec; 32():10552-10563. PubMed ID: 32265581
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Initial Solution Generation and Diversified Variable Picking in Local Search for (Weighted) Partial MaxSAT.
    Zhang Z; Zhou J; Wang X; Yang H; Fan Y
    Entropy (Basel); 2022 Dec; 24(12):. PubMed ID: 36554251
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Hiding solutions in random satisfiability problems: a statistical mechanics approach.
    Barthel W; Hartmann AK; Leone M; Ricci-Tersenghi F; Weigt M; Zecchina R
    Phys Rev Lett; 2002 May; 88(18):188701. PubMed ID: 12005728
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Fault detection and therapeutic intervention in gene regulatory networks using SAT solvers.
    Deshpande A; Layek RK
    Biosystems; 2019 May; 179():55-62. PubMed ID: 30831179
    [TBL] [Abstract][Full Text] [Related]  

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

  • 18. Amoeba-Inspired Heuristic Search Dynamics for Exploring Chemical Reaction Paths.
    Aono M; Wakabayashi M
    Orig Life Evol Biosph; 2015 Sep; 45(3):339-45. PubMed ID: 26129639
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Communities of solutions in single solution clusters of a random K-satisfiability formula.
    Zhou H; Ma H
    Phys Rev E Stat Nonlin Soft Matter Phys; 2009 Dec; 80(6 Pt 2):066108. PubMed ID: 20365232
    [TBL] [Abstract][Full Text] [Related]  

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

    [Next]    [New Search]
    of 9.