112 related articles for article (PubMed ID: 31395558)
1. 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]
2. 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]
3. Directed percolation and numerical stability of simulations of digital memcomputing machines.
Zhang YH; Di Ventra M
Chaos; 2021 Jun; 31(6):063127. PubMed ID: 34241305
[TBL] [Abstract][Full Text] [Related]
4. 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]
5. Accelerating deep learning with memcomputing.
Manukian H; Traversa FL; Di Ventra M
Neural Netw; 2019 Feb; 110():1-7. PubMed ID: 30458316
[TBL] [Abstract][Full Text] [Related]
6. Polynomial-time solution of prime factorization and NP-complete problems with digital memcomputing machines.
Traversa FL; Di Ventra M
Chaos; 2017 Feb; 27(2):023107. PubMed ID: 28249395
[TBL] [Abstract][Full Text] [Related]
7. Memcomputing NP-complete problems in polynomial time using polynomial resources and collective states.
Traversa FL; Ramella C; Bonani F; Di Ventra M
Sci Adv; 2015 Jul; 1(6):e1500031. PubMed ID: 26601208
[TBL] [Abstract][Full Text] [Related]
8. Absence of periodic orbits in digital memcomputing machines with solutions.
Di Ventra M; Traversa FL
Chaos; 2017 Oct; 27(10):101101. PubMed ID: 29092447
[TBL] [Abstract][Full Text] [Related]
9. Taming a nonconvex landscape with dynamical long-range order: Memcomputing Ising benchmarks.
Sheldon F; Traversa FL; Di Ventra M
Phys Rev E; 2019 Nov; 100(5-1):053311. PubMed ID: 31869932
[TBL] [Abstract][Full Text] [Related]
10. Memcomputing Numerical Inversion With Self-Organizing Logic Gates.
Manukian H; Traversa FL; Di Ventra M; Manukian H; Traversa FL; Di Ventra M; Di Ventra M; Manukian H; Traversa FL
IEEE Trans Neural Netw Learn Syst; 2018 Jun; 29(6):2645-2650. PubMed ID: 28500012
[TBL] [Abstract][Full Text] [Related]
11. On the Universality of Memcomputing Machines.
Pei YR; Traversa FL; Di Ventra M
IEEE Trans Neural Netw Learn Syst; 2019 Jun; 30(6):1610-1620. PubMed ID: 30387744
[TBL] [Abstract][Full Text] [Related]
12. Universal Memcomputing Machines.
Traversa FL; Di Ventra M
IEEE Trans Neural Netw Learn Syst; 2015 Nov; 26(11):2702-15. PubMed ID: 25667360
[TBL] [Abstract][Full Text] [Related]
13. Using synchronized oscillators to compute the maximum independent set.
Mallick A; Bashar MK; Truesdell DS; Calhoun BH; Joshi S; Shukla N
Nat Commun; 2020 Sep; 11(1):4689. PubMed ID: 32943644
[TBL] [Abstract][Full Text] [Related]
14. Ferroelectric compute-in-memory annealer for combinatorial optimization problems.
Yin X; Qian Y; Vardar A; Günther M; Müller F; Laleni N; Zhao Z; Jiang Z; Shi Z; Shi Y; Gong X; Zhuo C; Kämpfe T; Ni K
Nat Commun; 2024 Mar; 15(1):2419. PubMed ID: 38499524
[TBL] [Abstract][Full Text] [Related]
15. Challenges and opportunities for the simulation of calcium waves on modern multi-core and many-core parallel computing platforms.
Barajas C; Gobbert MK; Kroiz GC; Peercy BE
Int J Numer Method Biomed Eng; 2021 Nov; 37(11):e3244. PubMed ID: 31356001
[TBL] [Abstract][Full Text] [Related]
16. The backtracking survey propagation algorithm for solving random K-SAT problems.
Marino R; Parisi G; Ricci-Tersenghi F
Nat Commun; 2016 Oct; 7():12996. PubMed ID: 27694952
[TBL] [Abstract][Full Text] [Related]
17. 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]
18. Solving satisfiability problems by fluctuations: the dynamics of stochastic local search algorithms.
Barthel W; Hartmann AK; Weigt M
Phys Rev E Stat Nonlin Soft Matter Phys; 2003 Jun; 67(6 Pt 2):066104. PubMed ID: 16241301
[TBL] [Abstract][Full Text] [Related]
19. Extending XCS with Cyclic Graphs for Scalability on Complex Boolean Problems.
Iqbal M; Browne WN; Zhang M
Evol Comput; 2017; 25(2):173-204. PubMed ID: 26406166
[TBL] [Abstract][Full Text] [Related]
20. Qualifying quantum approaches for hard industrial optimization problems. A case study in the field of smart-charging of electric vehicles.
Dalyac C; Henriet L; Jeandel E; Lechner W; Perdrix S; Porcheron M; Veshchezerova M
EPJ Quantum Technol; 2021; 8(1):12. PubMed ID: 34723197
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
