Results 51 to 60 of about 5,433,526 (396)
Deep Reinforcement Learning for Collaborative Edge Computing in Vehicular Networks [PDF]
IEEE Transactions on Cognitive Communications and Networking, 2020 Mobile edge computing (MEC) is a promising technology to support mission-critical vehicular applications, such as intelligent path planning and safety applications.
Mushu Li +3 more
semanticscholar +1 more source
International Journal of Turbomachinery, Propulsion and Power, 2021 This paper presents a new improved approach to calculation of polytropic performance of centrifugal compressors. This rapid solution technique is based upon a constant efficiency, temperature-entropy polytropic path represented by cubic polynomials.
Matt Taher, Fred Evans
doaj +1 more source
A neural network for shortest path computation [PDF]
IEEE Transactions on Neural Networks, 2001 This paper presents a new neural network to solve the shortest path problem for inter-network routing. The proposed solution extends the traditional single-layer recurrent Hopfield architecture introducing a two-layer architecture that automatically guarantees an entire set of constraints held by any valid solution to the shortest path problem.
F. Araújo, B. Ribeiro, L. Rodrigues
openaire +4 more sources
Accelerating Tool Path Computing in Turning Lathe Machining
2007 3rd Southern Conference on Programmable Logic, 2007 Tool path generation is one of the most complex problems in computer aided manufacturing. Although some efficient strategies have been developed, most of them are only useful for standard machining.
A. Jimeno +3 more
semanticscholar +1 more source
Line-distortion, Bandwidth and Path-length of a graph [PDF]
, 2014 We investigate the minimum line-distortion and the minimum bandwidth problems on unweighted graphs and their relations with the minimum length of a Robertson-Seymour's path-decomposition.
A. Gupta +15 more
core +1 more source
Information, 2021 The current IT market is more and more dominated by the “cloud continuum”. In the “traditional” cloud, computing resources are typically homogeneous in order to facilitate economies of scale.
Juncal Alonso +6 more
doaj +1 more source
Batch Hop-Constrained s-t Simple Path Query Processing in Large Graphs [PDF]
arXiv, 2023 Hop-constrained s-t simple path (HC-s-t path) enumeration is a fundamental problem in graph analysis. Existing solutions for this problem focus on optimizing the processing performance of a single query. However, in practice, it is more often that multiple HC-s-t path queries are issued simultaneously and processed as a batch.
arxiv
When the path is never shortest: a reality check on shortest path biocomputation
, 2017 Shortest path problems are a touchstone for evaluating the computing performance and functional range of novel computing substrates. Much has been published in recent years regarding the use of biocomputers to solve minimal path problems such as route ...
A Adamatzky +28 more
core +1 more source
The minimum energy expenditure shortest path method [PDF]
, 2014 This article discusses the addition of an energy parameter to the shortest path execution process; namely, the energy expenditure by a character during execution of the path.
Choset H. +14 more
core +1 more source
Shortest path computation with no information leakage [PDF]
Proceedings of the VLDB Endowment, 2012 Shortest path computation is one of the most common queries in location-based services (LBSs). Although particularly useful, such queries raise serious privacy concerns. Exposing to a (potentially untrusted) LBS the client's position and her destination may reveal personal information, such as social habits, health condition, shopping preferences ...
MOURATIDIS, Kyriakos, YIU, Man Lung
openaire +4 more sources