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 *

126 related articles for article (PubMed ID: 38658582)

  • 1. Energy-efficient superparamagnetic Ising machine and its application to traveling salesman problems.
    Si J; Yang S; Cen Y; Chen J; Huang Y; Yao Z; Kim DJ; Cai K; Yoo J; Fong X; Yang H
    Nat Commun; 2024 Apr; 15(1):3457. PubMed ID: 38658582
    [TBL] [Abstract][Full Text] [Related]  

  • 2. A Parallel DNA Algorithm for Solving the Quota Traveling Salesman Problem Based on Biocomputing Model.
    Wang Z; Wu X; Wu T
    Comput Intell Neurosci; 2022; 2022():1450756. PubMed ID: 36093485
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Oscillatory Neural Network-Based Ising Machine Using 2D Memristors.
    Chen X; Yang D; Hwang G; Dong Y; Cui B; Wang D; Chen H; Lin N; Zhang W; Li H; Shao R; Lin P; Hong H; Yao Y; Sun L; Wang Z; Yang H
    ACS Nano; 2024 Apr; 18(16):10758-10767. PubMed ID: 38598699
    [TBL] [Abstract][Full Text] [Related]  

  • 4. A single shot coherent Ising machine based on a network of injection-locked multicore fiber lasers.
    Babaeian M; Nguyen DT; Demir V; Akbulut M; Blanche PA; Kaneda Y; Guha S; Neifeld MA; Peyghambarian N
    Nat Commun; 2019 Aug; 10(1):3516. PubMed ID: 31388011
    [TBL] [Abstract][Full Text] [Related]  

  • 5. Quadrature photonic spatial Ising machine.
    Sun W; Zhang W; Liu Y; Liu Q; He Z
    Opt Lett; 2022 Mar; 47(6):1498-1501. PubMed ID: 35290348
    [TBL] [Abstract][Full Text] [Related]  

  • 6. Energy-efficient stochastic computing with superparamagnetic tunnel junctions.
    Daniels MW; Madhavan A; Talatchian P; Mizrahi A; Stiles MD
    Phys Rev Appl; 2020; 13(3):. PubMed ID: 33043097
    [TBL] [Abstract][Full Text] [Related]  

  • 7. Comparison between a quantum annealer and a classical approximation algorithm for computing the ground state of an Ising spin glass.
    Yaacoby R; Schaar N; Kellerhals L; Raz O; Hermelin D; Pugatch R
    Phys Rev E; 2022 Mar; 105(3-2):035305. PubMed ID: 35428085
    [TBL] [Abstract][Full Text] [Related]  

  • 8. E-Spin: A Stochastic Ising Spin Based on Electrically-Controlled MTJ for Constructing Large-Scale Ising Annealing Systems.
    Chen W; Tang H; Wang Y; Hu X; Lin Y; Min T; Xie Y
    Micromachines (Basel); 2023 Jan; 14(2):. PubMed ID: 36837958
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Efficient combinatorial optimization by quantum-inspired parallel annealing in analogue memristor crossbar.
    Jiang M; Shan K; He C; Li C
    Nat Commun; 2023 Sep; 14(1):5927. PubMed ID: 37739944
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Fast-Converging Simulated Annealing for Ising Models Based on Integral Stochastic Computing.
    Onizawa N; Katsuki K; Shin D; Gross WJ; Hanyu T
    IEEE Trans Neural Netw Learn Syst; 2023 Dec; 34(12):10999-11005. PubMed ID: 35344497
    [TBL] [Abstract][Full Text] [Related]  

  • 11. A 16-bit Coherent Ising Machine for One-Dimensional Ring and Cubic Graph Problems.
    Takata K; Marandi A; Hamerly R; Haribara Y; Maruo D; Tamate S; Sakaguchi H; Utsunomiya S; Yamamoto Y
    Sci Rep; 2016 Sep; 6():34089. PubMed ID: 27659312
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Amoeba-inspired analog electronic computing system integrating resistance crossbar for solving the travelling salesman problem.
    Saito K; Aono M; Kasai S
    Sci Rep; 2020 Nov; 10(1):20772. PubMed ID: 33247175
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Million city traveling salesman problem solution by divide and conquer clustering with adaptive resonance neural networks.
    Mulder SA; Wunsch DC
    Neural Netw; 2003; 16(5-6):827-32. PubMed ID: 12850040
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Solving the clustered traveling salesman problem
    Lu Y; Hao JK; Wu Q
    PeerJ Comput Sci; 2022; 8():e972. PubMed ID: 35721414
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Comparative Study of Variations in Quantum Approximate Optimization Algorithms for the Traveling Salesman Problem.
    Qian W; Basili RAM; Eshaghian-Wilner MM; Khokhar A; Luecke G; Vary JP
    Entropy (Basel); 2023 Aug; 25(8):. PubMed ID: 37628268
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Solving Traveling Salesman Problems Based on Artificial Cooperative Search Algorithm.
    Liu G; Xu X; Wang F; Tang Y
    Comput Intell Neurosci; 2022; 2022():1008617. PubMed ID: 35463281
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Intrinsic optimization using stochastic nanomagnets.
    Sutton B; Camsari KY; Behin-Aein B; Datta S
    Sci Rep; 2017 Mar; 7():44370. PubMed ID: 28295053
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Annealing by simulating the coherent Ising machine.
    Tiunov ES; Ulanov AE; Lvovsky AI
    Opt Express; 2019 Apr; 27(7):10288-10295. PubMed ID: 31045172
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Point convolutional neural network algorithm for Ising model ground state research based on spring vibration.
    Jiang Z; Chen G; Qiao R; Feng P; Chen Y; Su J; Zhao Z; Jin M; Chen X; Li Z; Lu H
    Sci Rep; 2024 Feb; 14(1):2643. PubMed ID: 38302489
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Optimization by quantum annealing: lessons from hard satisfiability problems.
    Battaglia DA; Santoro GE; Tosatti E
    Phys Rev E Stat Nonlin Soft Matter Phys; 2005 Jun; 71(6 Pt 2):066707. PubMed ID: 16089911
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 7.