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 *

190 related articles for article (PubMed ID: 27190753)

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

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

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

  • 5. Heuristic-based tabu search algorithm for folding two-dimensional AB off-lattice model proteins.
    Liu J; Sun Y; Li G; Song B; Huang W
    Comput Biol Chem; 2013 Dec; 47():142-8. PubMed ID: 24077543
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 9. Trajectories in phase diagrams, growth processes, and computational complexity: how search algorithms solve the 3-satisfiability problem.
    Cocco S; Monasson R
    Phys Rev Lett; 2001 Feb; 86(8):1654-7. PubMed ID: 11290216
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

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

  • 14. A parallel attractor-finding algorithm based on Boolean satisfiability for genetic regulatory networks.
    Guo W; Yang G; Wu W; He L; Sun M
    PLoS One; 2014; 9(4):e94258. PubMed ID: 24718686
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Asymmetric continuous-time neural networks without local traps for solving constraint satisfaction problems.
    Molnár B; Ercsey-Ravasz M
    PLoS One; 2013; 8(9):e73400. PubMed ID: 24066045
    [TBL] [Abstract][Full Text] [Related]  

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

  • 17. An Efficient Steady-State Analysis Method for Large Boolean Networks with High Maximum Node Connectivity.
    Hong C; Hwang J; Cho KH; Shin I
    PLoS One; 2015; 10(12):e0145734. PubMed ID: 26716694
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Analog Approach to Constraint Satisfaction Enabled by Spin Orbit Torque Magnetic Tunnel Junctions.
    Wijesinghe P; Liyanagedera C; Roy K
    Sci Rep; 2018 May; 8(1):6940. PubMed ID: 29720596
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Biased random satisfiability problems: from easy to hard instances.
    Ramezanpour A; Moghimi-Araghi S
    Phys Rev E Stat Nonlin Soft Matter Phys; 2005 Jun; 71(6 Pt 2):066101. PubMed ID: 16089814
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Amoeba-inspired nanoarchitectonic computing: solving intractable computational problems using nanoscale photoexcitation transfer dynamics.
    Aono M; Naruse M; Kim SJ; Wakabayashi M; Hori H; Ohtsu M; Hara M
    Langmuir; 2013 Jun; 29(24):7557-64. PubMed ID: 23565603
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 10.