Results 261 to 270 of about 1,024,245 (290)
Some of the next articles are maybe not open access.
Intricacies of quantum computational paths
Quantum Information Processing, 2012zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Tarrataca, Luís, Wichert, Andreas
openaire +2 more sources
Computing the nxm shortest path efficiently
ACM Journal of Experimental Algorithmics, 1999Computation of all the shortest paths between multiple sources and multiple destinations on various networks is required in many problems, such as the traveling salesperson problem (TSP) and the vehicle routing problem (VRP). This paper proposes new algorithms that compute the set of shortest paths efficiently by using the A<sup>*</sup> ...
openaire +1 more source
Multi-UAV Mobile Edge Computing and Path Planning Platform Based on Reinforcement Learning
IEEE Transactions on Emerging Topics in Computational Intelligence, 2022Huan Chang, Yicheng Chen, Baochang Zhang
exaly
A Survey on In-Network Computing: Programmable Data Plane and Technology Specific Applications
IEEE Communications Surveys and Tutorials, 2023Somayeh Kianpisheh
exaly
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 +1 more source
IEEE Transactions on Network Science and Engineering, 2022
Chen Wang, Zhiyuan Ren, Wen-Chi Cheng
exaly
Chen Wang, Zhiyuan Ren, Wen-Chi Cheng
exaly
Drone Swarm Path Planning for Mobile Edge Computing in Industrial Internet of Things
IEEE Transactions on Industrial Informatics, 2023Yiming Miao, Kai Hwang, Di Wu
exaly
Path Selection for Seamless Service Migration in Vehicular Edge Computing
IEEE Internet of Things Journal, 2020Jinliang Xu, Xiao, Ao Zhou
exaly

