Brief Announcement: Provable neuromorphic advantages for computing constrained shortest paths.
Conference
·
OSTI ID:1814114
Abstract not provided.
- Research Organization:
- Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Sandia National Lab. (SNL-CA), Livermore, CA (United States)
- Sponsoring Organization:
- USDOE National Nuclear Security Administration (NNSA)
- DOE Contract Number:
- NA0003525
- OSTI ID:
- 1814114
- Report Number(s):
- SAND2020-8457C; 689959
- Resource Relation:
- Conference: Proposed for presentation at the 32nd ACM Symposium on Parallelism in Algorithms and Architectures held July 15-16, 2020 in Online.
- Country of Publication:
- United States
- Language:
- English
Similar Records
Brief Announcement: Provable neuromorphic advantages for computing constrained shortest paths.
Provable advantages for graph algorithms in spiking neural networks.
Provable Advantages for Graph Algorithms in Spiking Neural Networks.
Conference
·
2020
·
OSTI ID:1808434
+4 more
Provable advantages for graph algorithms in spiking neural networks.
Conference
·
2021
·
OSTI ID:1871422
+4 more
Provable Advantages for Graph Algorithms in Spiking Neural Networks.
Conference
·
2021
·
OSTI ID:1890920
+4 more