- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
2045-2322
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
online resource.
- Bibliographic citation
-
Combinatorial optimization by weight annealing in memristive hopfield networks ; volume:11 ; number:1 ; day:12 ; month:8 ; year:2021 ; pages:1-10 ; date:12.2021
Scientific reports ; 11, Heft 1 (12.8.2021), 1-10, 12.2021
- Creator
-
Fahimi, Z.
Mahmoodi, M. R.
Nili, H.
Polishchuk, Valentin
Strukov, D. B.
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1038/s41598-020-78944-5
- URN
-
urn:nbn:de:101:1-2022112709203385226352
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
15.08.2025, 7:27 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Fahimi, Z.
- Mahmoodi, M. R.
- Nili, H.
- Polishchuk, Valentin
- Strukov, D. B.
- SpringerLink (Online service)
Other Objects (12)
In‐Materia Annealing and Combinatorial Optimization Based on Vertical Memristive Array
Simulated Annealing Beats Metropolis in Combinatorial Optimization
Performance of quantum annealing inspired algorithms for combinatorial optimization problems
On the emerging potential of quantum annealing hardware for combinatorial optimization
Efficient combinatorial optimization by quantum-inspired parallel annealing in analogue memristor crossbar
Combinatorial optimization :
Combinatorial optimization :
Eigenvalues in combinatorial optimization
Developments in combinatorial optimization
Combinatorial optimization for undergraduates
Enhanced convergence in p-bit based simulated annealing with partial deactivation for large-scale combinatorial optimization problems
Recoverable robustness in combinatorial optimization
In‐Materia Annealing and Combinatorial Optimization Based on Vertical Memristive Array
Simulated Annealing Beats Metropolis in Combinatorial Optimization
Performance of quantum annealing inspired algorithms for combinatorial optimization problems
On the emerging potential of quantum annealing hardware for combinatorial optimization
Efficient combinatorial optimization by quantum-inspired parallel annealing in analogue memristor crossbar
Combinatorial optimization :
Combinatorial optimization :
Eigenvalues in combinatorial optimization
Developments in combinatorial optimization
Combinatorial optimization for undergraduates
Enhanced convergence in p-bit based simulated annealing with partial deactivation for large-scale combinatorial optimization problems
Recoverable robustness in combinatorial optimization
In‐Materia Annealing and Combinatorial Optimization Based on Vertical Memristive Array
Simulated Annealing Beats Metropolis in Combinatorial Optimization
Performance of quantum annealing inspired algorithms for combinatorial optimization problems
On the emerging potential of quantum annealing hardware for combinatorial optimization
Efficient combinatorial optimization by quantum-inspired parallel annealing in analogue memristor crossbar
Combinatorial optimization :
Combinatorial optimization :
Eigenvalues in combinatorial optimization
Developments in combinatorial optimization
Combinatorial optimization for undergraduates
Enhanced convergence in p-bit based simulated annealing with partial deactivation for large-scale combinatorial optimization problems