Results 271 to 280 of about 1,024,245 (290)
Some of the next articles are maybe not open access.
Dynamical memristors for higher-complexity neuromorphic computing
Nature Reviews Materials, 2022Suhas Kumar +2 more
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 +1 more source
An Effective Sneak‐Path Solution Based on a Transient‐Relaxation Device
Advanced Materials, 2023Jun Yao
exaly
A Strategic Value Appropriation Path for Cloud Computing
Journal of Management Information Systems, 2018Abhishek Kathuria +2 more
exaly
Joint Optimization of Path Planning and Resource Allocation in Mobile Edge Computing
IEEE Transactions on Mobile Computing, 2020Yu Liu, Yong Li, Yong Niu
exaly
GPU computing for accelerating the numerical Path Integration approach
Computers and Structures, 2016Panagiotis Alevras, Daniil Yurchenko
exaly
Mobile Edge Computing via a UAV-Mounted Cloudlet: Optimization of Bit Allocation and Path Planning
IEEE Transactions on Vehicular Technology, 2018Seongah Jeong +2 more
exaly