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 *

107 related articles for article (PubMed ID: 38771685)

  • 1. A Graph-Neural-Network-Powered Solver Framework for Graph Optimization Problems.
    Zhang C; Gao Y; Nastos J
    IEEE Trans Neural Netw Learn Syst; 2024 Sep; 35(9):11746-11760. PubMed ID: 38771685
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 4. Graph Neural Networks for Maximum Constraint Satisfaction.
    Tönshoff J; Ritzert M; Wolf H; Grohe M
    Front Artif Intell; 2020; 3():580607. PubMed ID: 33733220
    [TBL] [Abstract][Full Text] [Related]  

  • 5. Use of proximal operator graph solver for radiation therapy inverse treatment planning.
    Liu X; Pelizzari C; Belcher AH; Grelewicz Z; Wiersma RD
    Med Phys; 2017 Apr; 44(4):1246-1256. PubMed ID: 28211070
    [TBL] [Abstract][Full Text] [Related]  

  • 6. Payoff-monotonic game dynamics and the maximum clique problem.
    Pelillo M; Torsello A
    Neural Comput; 2006 May; 18(5):1215-58. PubMed ID: 16595063
    [TBL] [Abstract][Full Text] [Related]  

  • 7. Neural Improvement Heuristics for Graph Combinatorial Optimization Problems.
    Garmendia AI; Ceberio J; Mendiburu A
    IEEE Trans Neural Netw Learn Syst; 2023 Oct; PP():. PubMed ID: 37792652
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Approximating maximum clique with a Hopfield network.
    Jagota A
    IEEE Trans Neural Netw; 1995; 6(3):724-35. PubMed ID: 18263357
    [TBL] [Abstract][Full Text] [Related]  

  • 9. ASP: Learn a Universal Neural Solver!
    Wang C; Yu Z; McAleer S; Yu T; Yang Y
    IEEE Trans Pattern Anal Mach Intell; 2024 Jun; 46(6):4102-4114. PubMed ID: 38198269
    [TBL] [Abstract][Full Text] [Related]  

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

  • 11. BioGraphE: high-performance bionetwork analysis using the Biological Graph Environment.
    Chin G; Chavarria DG; Nakamura GC; Sofia HJ
    BMC Bioinformatics; 2008 May; 9 Suppl 6(Suppl 6):S6. PubMed ID: 18541059
    [TBL] [Abstract][Full Text] [Related]  

  • 12. A Graph-Based Neural Approach to Linear Sum Assignment Problems.
    Aironi C; Cornell S; Squartini S
    Int J Neural Syst; 2024 Mar; 34(3):2450011. PubMed ID: 38231046
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Approximating the maximum weight clique using replicator dynamics.
    Bomze IR; Pelillo M; Stix V
    IEEE Trans Neural Netw; 2000; 11(6):1228-41. PubMed ID: 18249849
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Neural Graph Matching Network: Learning Lawler's Quadratic Assignment Problem With Extension to Hypergraph and Multiple-Graph Matching.
    Wang R; Yan J; Yang X
    IEEE Trans Pattern Anal Mach Intell; 2022 Sep; 44(9):5261-5279. PubMed ID: 33961550
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Generalized Flows for Optimal Inference in Higher Order MRF-MAP.
    Arora C; Banerjee S; Kalra PK; Maheshwari SN
    IEEE Trans Pattern Anal Mach Intell; 2015 Jul; 37(7):1323-35. PubMed ID: 26352442
    [TBL] [Abstract][Full Text] [Related]  

  • 16. TIVC: An Efficient Local Search Algorithm for Minimum Vertex Cover in Large Graphs.
    Zhang Y; Wang S; Liu C; Zhu E
    Sensors (Basel); 2023 Sep; 23(18):. PubMed ID: 37765887
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Constraint satisfaction adaptive neural network and heuristics combined approaches for generalized job-shop scheduling.
    Yang S; Wang D
    IEEE Trans Neural Netw; 2000; 11(2):474-86. PubMed ID: 18249776
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Hard optimization problems have soft edges.
    Marino R; Kirkpatrick S
    Sci Rep; 2023 Mar; 13(1):3671. PubMed ID: 36871049
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Faster heuristics for graph burning.
    Gautam RK; Kare AS; S DB
    Appl Intell (Dordr); 2022; 52(2):1351-1361. PubMed ID: 34764602
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Measurement optimization in the variational quantum eigensolver using a minimum clique cover.
    Verteletskyi V; Yen TC; Izmaylov AF
    J Chem Phys; 2020 Mar; 152(12):124114. PubMed ID: 32241154
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 6.