Results 371 to 380 of about 5,507,173 (401)
Some of the next articles are maybe not open access.
2D Material Based Synaptic Devices for Neuromorphic Computing
Advanced Functional Materials, 2021Chao Zhu, Fucai Liu, Zheng Liu
exaly
Computing Shortest Paths in Networks
1975The finding of shortest paths in networks is one of the most basic combinatorial optimization problems, and the algorithms for solving these problems are among the most widely used. The reader is probably aware that a variety of optimization problems, some of which appear to have little to do with paths in networks, can be formulated as shortest path ...
openaire +2 more sources
Optimization techniques for curved path computing
The Visual Computer, 2007A. Muñoz, D. Gutierrez, F. Serón
semanticscholar +1 more source
A simple yet efficient aggregated path computing method
, 2012Donghong Qin +5 more
semanticscholar +1 more source
Critical Path Analysis by Computer
1984Some of the techniques described early in the book—especially resource scheduling—are fairly tedious; all (despite the existence of cross-checks) are susceptible to clerical error; and some of the more advanced techniques described in Chapter 6 require an amount of computation which really is beyond manual processing.
openaire +2 more sources
Automated synthesis of compact crossbars for sneak-path based in-memory computing
Design, Automation and Test in Europe, 2017Dwaipayan Chakraborty, Sumit Kumar Jha
semanticscholar +1 more source
Hybrid computing using a neural network with dynamic external memory
Nature, 2016Alex Graves +19 more
semanticscholar +1 more source
On computing a longest path in a tree
Information Processing Letters, 2002F. van der Sommen +5 more
openaire +2 more sources
Dynamical memristors for higher-complexity neuromorphic computing
Nature Reviews Materials, 2022Suhas Kumar +2 more
exaly