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 *

132 related articles for article (PubMed ID: 16241301)

  • 21. Order-to-chaos transition in the hardness of random Boolean satisfiability problems.
    Varga M; Sumi R; Toroczkai Z; Ercsey-Ravasz M
    Phys Rev E; 2016 May; 93(5):052211. PubMed ID: 27300884
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 24. Broad relaxation spectrum and the field theory of glassy dynamics for pinned elastic systems.
    Balents L; Le Doussal P
    Phys Rev E Stat Nonlin Soft Matter Phys; 2004 Jun; 69(6 Pt 1):061107. PubMed ID: 15244540
    [TBL] [Abstract][Full Text] [Related]  

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

  • 26. Developing learning algorithms via optimized discretization of continuous dynamical systems.
    Tao Q; Sun Z; Kong K
    IEEE Trans Syst Man Cybern B Cybern; 2012 Feb; 42(1):140-9. PubMed ID: 21880573
    [TBL] [Abstract][Full Text] [Related]  

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

  • 28. Balanced K-satisfiability and biased random K-satisfiability on trees.
    Sumedha ; Krishnamurthy S; Sahoo S
    Phys Rev E Stat Nonlin Soft Matter Phys; 2013 Apr; 87(4):042130. PubMed ID: 23826613
    [TBL] [Abstract][Full Text] [Related]  

  • 29. Relaxation and metastability in a local search procedure for the random satisfiability problem.
    Semerjian G; Monasson R
    Phys Rev E Stat Nonlin Soft Matter Phys; 2003 Jun; 67(6 Pt 2):066103. PubMed ID: 16241300
    [TBL] [Abstract][Full Text] [Related]  

  • 30. An evaluation of methods for estimating the number of local optima in combinatorial optimization problems.
    Hernando L; Mendiburu A; Lozano JA
    Evol Comput; 2013; 21(4):625-58. PubMed ID: 23270389
    [TBL] [Abstract][Full Text] [Related]  

  • 31. Portfolios of quantum algorithms.
    Maurer SM; Hogg T; Huberman BA
    Phys Rev Lett; 2001 Dec; 87(25):257901. PubMed ID: 11736605
    [TBL] [Abstract][Full Text] [Related]  

  • 32. Multimodal optimization using a bi-objective evolutionary algorithm.
    Deb K; Saha A
    Evol Comput; 2012; 20(1):27-62. PubMed ID: 21591888
    [TBL] [Abstract][Full Text] [Related]  

  • 33. Stress-Testing Memcomputing on Hard Combinatorial Optimization Problems.
    Sheldon F; Cicotti P; Traversa FL; Di Ventra M
    IEEE Trans Neural Netw Learn Syst; 2020 Jun; 31(6):2222-2226. PubMed ID: 31395558
    [TBL] [Abstract][Full Text] [Related]  

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

  • 35. Analytical and belief-propagation studies of random constraint satisfaction problems with growing domains.
    Zhao C; Zhang P; Zheng Z; Xu K
    Phys Rev E Stat Nonlin Soft Matter Phys; 2012 Jan; 85(1 Pt 2):016106. PubMed ID: 22400624
    [TBL] [Abstract][Full Text] [Related]  

  • 36. Theory of Nonequilibrium Local Search on Random Satisfaction Problems.
    Aurell E; Domínguez E; Machado D; Mulet R
    Phys Rev Lett; 2019 Dec; 123(23):230602. PubMed ID: 31868433
    [TBL] [Abstract][Full Text] [Related]  

  • 37. Self-averaging of digital memcomputing machines.
    Primosch D; Zhang YH; Di Ventra M
    Phys Rev E; 2023 Sep; 108(3-1):034306. PubMed ID: 37849117
    [TBL] [Abstract][Full Text] [Related]  

  • 38. Constraint satisfaction problems and neural networks: A statistical physics perspective.
    Mézard M; Mora T
    J Physiol Paris; 2009; 103(1-2):107-13. PubMed ID: 19616623
    [TBL] [Abstract][Full Text] [Related]  

  • 39. Stochastic dynamics of complexation reaction in the limit of small numbers.
    Ghosh K
    J Chem Phys; 2011 May; 134(19):195101. PubMed ID: 21599088
    [TBL] [Abstract][Full Text] [Related]  

  • 40. A stochastic algorithm for global optimization and for best populations: a test case of side chains in proteins.
    Glick M; Rayan A; Goldblum A
    Proc Natl Acad Sci U S A; 2002 Jan; 99(2):703-8. PubMed ID: 11792838
    [TBL] [Abstract][Full Text] [Related]  

    [Previous]   [Next]    [New Search]
    of 7.