Brief Announcement: Provable neuromorphic advantages for computing constrained shortest paths.
Conference
·
OSTI ID:1808434
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:
- AC04-94AL85000
- OSTI ID:
- 1808434
- Report Number(s):
- SAND2020-7042C; 687248
- Resource Relation:
- Conference: Proposed for presentation at the 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2020) held July 14-17, 2020 in Philadelphia, PA, US.
- Country of Publication:
- United States
- Language:
- English
Similar Records
Brief Announcement: Provable neuromorphic advantages for computing constrained shortest paths.
Efficient Neuromorphic Computing in SWaP-Constrained Environments.
Path Sampling: A Fast and Provable Method for Estimating 4- vertex subgraph counts.
Conference
·
2020
·
OSTI ID:1814114
+4 more
Efficient Neuromorphic Computing in SWaP-Constrained Environments.
Conference
·
2019
·
OSTI ID:1641234
+6 more
Path Sampling: A Fast and Provable Method for Estimating 4- vertex subgraph counts.
Conference
·
2015
·
OSTI ID:1258223