Results 51 to 60 of about 5,064,874 (383)
Computing a rectilinear shortest path amid splinegons in plane
We reduce the problem of computing a rectilinear shortest path between two given points s and t in the splinegonal domain \calS to the problem of computing a rectilinear shortest path between two points in the polygonal domain. As part of this, we define
DP Dobkin +16 more
core +1 more source
Approximate Bayesian Computation with Path Signatures
42 pages, 8 ...
Dyer, J, Cannon, P, Schmon, SM
openaire +3 more sources
The Computing Network is an emerging network paradigm that aims to realize computing resource scheduling through the intrinsic capabilities of the network.
Zhihui Ni, Jiali You, Yang Li
semanticscholar +1 more source
A Survey of Path Planning Algorithms for Mobile Robots
Path planning algorithms are used by mobile robots, unmanned aerial vehicles, and autonomous cars in order to identify safe, efficient, collision-free, and least-cost travel paths from an origin to a destination.
Karthik Karur +3 more
semanticscholar +1 more source
Enhanced FRER Mechanism in Time-Sensitive Networking for Reliable Edge Computing
Time-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
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
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
Quantum Diagrams and Quantum Networks
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
Separation of Variables and the Computation of Fourier Transforms on Finite Groups, II [PDF]
We present a general diagrammatic approach to the construction of efficient algorithms for computing the Fourier transform of a function on a finite group.
Maslen, David +2 more
core +3 more sources
Computational intelligence and soft computing: some thoughts on already explored and not yet explored paths [PDF]
We comment upon the very essence, roots, potentials, and applicability of computational intelligence and soft computing. We followed a different path than those traditionally employed, and which are so well and in a deep and comprehensive way documented ...
Janusz Kacprzyk
doaj +1 more source

