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 *

111 related articles for article (PubMed ID: 18244411)

  • 1. Energy function-based approaches to graph coloring.
    Di Blas A; Jagota A; Hughey R
    IEEE Trans Neural Netw; 2002; 13(1):81-91. PubMed ID: 18244411
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Iterated Clique Reductions in Vertex Weighted Coloring for Large Sparse Graphs.
    Fan Y; Zhang Z; Yu Q; Lai Y; Su K; Wang Y; Pan S; Latecki LJ
    Entropy (Basel); 2023 Sep; 25(10):. PubMed ID: 37895498
    [TBL] [Abstract][Full Text] [Related]  

  • 3. A hopfield network learning method for bipartite subgraph problem.
    Wang RL; Tang Z; Cao QP
    IEEE Trans Neural Netw; 2004 Nov; 15(6):1458-65. PubMed ID: 15565773
    [TBL] [Abstract][Full Text] [Related]  

  • 4. Broadcast scheduling in wireless multihop networks using a neural-network-based hybrid algorithm.
    Shi H; Wang L
    Neural Netw; 2005; 18(5-6):765-71. PubMed ID: 16087313
    [TBL] [Abstract][Full Text] [Related]  

  • 5. Discovering topological motifs using a compact notation.
    Parida L
    J Comput Biol; 2007 Apr; 14(3):300-23. PubMed ID: 17563313
    [TBL] [Abstract][Full Text] [Related]  

  • 6. Graph coloring using the reduced quantum genetic algorithm.
    Ardelean SM; Udrescu M
    PeerJ Comput Sci; 2022; 8():e836. PubMed ID: 35111921
    [TBL] [Abstract][Full Text] [Related]  

  • 7. Cooperative updating in the Hopfield model.
    Munehisa T; Kobayashi M; Yamazaki H
    IEEE Trans Neural Netw; 2001; 12(5):1243-51. PubMed ID: 18249951
    [TBL] [Abstract][Full Text] [Related]  

  • 8. An annealed chaotic maximum neural network for bipartite subgraph problem.
    Wang J; Tang Z; Wang R
    Int J Neural Syst; 2004 Apr; 14(2):107-16. PubMed ID: 15112368
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Design and analysis of maximum Hopfield networks.
    Galán-Marín G; Muñoz-Pérez J
    IEEE Trans Neural Netw; 2001; 12(2):329-39. PubMed ID: 18244387
    [TBL] [Abstract][Full Text] [Related]  

  • 10. An improved neural network model for the two-page crossing number problem.
    He H; Sýkora O; Mäkinen E
    IEEE Trans Neural Netw; 2006 Nov; 17(6):1642-6. PubMed ID: 17131678
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Random graph coloring: statistical physics approach.
    van Mourik J; Saad D
    Phys Rev E Stat Nonlin Soft Matter Phys; 2002 Nov; 66(5 Pt 2):056120. PubMed ID: 12513569
    [TBL] [Abstract][Full Text] [Related]  

  • 12. A Linear-Time Algorithm for 4-Coloring Some Classes of Planar Graphs.
    Liang Z; Wei H
    Comput Intell Neurosci; 2021; 2021():7667656. PubMed ID: 34650606
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Partition Independent Set and Reduction-Based Approach for Partition Coloring Problem.
    Zhu E; Jiang F; Liu C; Xu J
    IEEE Trans Cybern; 2022 Jun; 52(6):4960-4969. PubMed ID: 33108304
    [TBL] [Abstract][Full Text] [Related]  

  • 14. A parallel improvement algorithm for the bipartite subgraph problem.
    Lee KC; Funabiki N; Takefuji Y
    IEEE Trans Neural Netw; 1992; 3(1):139-45. PubMed ID: 18276415
    [TBL] [Abstract][Full Text] [Related]  

  • 15. A DNA algorithm for the graph coloring problem.
    Liu W; Zhang F; Xu J
    J Chem Inf Comput Sci; 2002; 42(5):1176-8. PubMed ID: 12377006
    [TBL] [Abstract][Full Text] [Related]  

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

  • 17. "Optimal" Hopfield network for combinatorial optimization with linear cost function.
    Matsuda S
    IEEE Trans Neural Netw; 1998; 9(6):1319-30. PubMed ID: 18255812
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Optimal competitive hopfield network with stochastic dynamics for maximum cut problem.
    Wang J; Tang Z; Cao Q; Wang R
    Int J Neural Syst; 2004 Aug; 14(4):257-65. PubMed ID: 15372703
    [TBL] [Abstract][Full Text] [Related]  

  • 19. A gradual noisy chaotic neural network for solving the broadcast scheduling problem in packet radio networks.
    Wang L; Shi H
    IEEE Trans Neural Netw; 2006 Jul; 17(4):989-1000. PubMed ID: 16856661
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Energy-Efficient Algorithm for Multicasting in Duty-Cycled Sensor Networks.
    Chen Q; Cheng S; Gao H; Li J; Cai Z
    Sensors (Basel); 2015 Dec; 15(12):31224-43. PubMed ID: 26690446
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 6.