Results 41 to 50 of about 989,695 (238)
Applied Sciences, 2022 Recent years have witnessed a paradigm shift from centralized cloud computing to decentralized edge computing. As a key enabler technique in edge computing, computation offloading migrates computation-intensive tasks from resource-limited devices to ...
Bo Xu +5 more
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
Dark path holonomic qudit computation
Physical Review A, 2022 New figure 2 added; several minor changes; references added; journal reference ...
Tomas André, Erik Sjöqvist
openaire +3 more sources
Enhanced FRER Mechanism in Time-Sensitive Networking for Reliable Edge Computing
SensorsTime-Sensitive Networking (TSN) and edge computing are promising networking technologies for the future of the Industrial Internet. TSN provides a reliable and deterministic low-latency communication service for edge computing.
Shaoliu Hu +3 more
doaj +1 more source
Computing as a service pattern based on edge computing
Dianzi Jishu Yingyong, 2019 Edge computing is a computational model for all terminal devices from cloud to edge path, which emerges in the era of interconnection of all things. The existing server pattern under cloud computing model cannot satisfy the application requirements of ...
Wang Tengfei +5 more
doaj +1 more source
IEEE Access, 2020 During mobile edge computing, due to the movement of nodes and the exhaustion of node energy, link failure occurs thus reducing the network lifetime in the mobile ad-hoc network. When the route fails, because the single-path protocols need to restart the
De-Gan Zhang +6 more
doaj +1 more source
Computing and Listing Avoidable Vertices and Paths
Algorithmica, 2022 AbstractA simplicial vertex of a graph is a vertex whose neighborhood is a clique. It is known that listing all simplicial vertices can be done in O(nm) time or $$O(n^{\omega })$$ O ( n ω )
Charis Papadopoulos, Athanasios E. Zisis
openaire +2 more sources
Memristive Crossbar Arrays for Storage and Computing Applications
Advanced Intelligent Systems, 2021 The emergence of memristors with potential applications in data storage and artificial intelligence has attracted wide attentions. Memristors are assembled in crossbar arrays with data bits encoded by the resistance of individual cells.
Huihan Li +10 more
doaj +1 more source
Quantum Diagrams and Quantum Networks
, 2014 This paper is an introduction to diagrammatic methods for representing quantum processes and quantum computing. We review basic notions for quantum information and quantum computing.
Kauffman, Louis H. +1 more
core +1 more source
Spatiotemporal Barcodes for Image Sequence Analysis [PDF]
, 2015 Taking as input a time-varying sequence of two-dimensional (2D) binary images, we develop an algorithm for computing a spatiotemporal 0–barcode encoding lifetime of connected components on the image sequence over time.
González Díaz, Rocío +2 more
core +1 more source