Results 41 to 50 of about 1,031,530 (335)
Computing homotopic shortest paths efficiently [PDF]
Computational Geometry, 2002 12 pages, 11 ...
Alon Efrat +2 more
openaire +2 more sources
Robot Static Path Planning Method Based on Deterministic Annealing
Machines, 2022 Heuristic calculation is an essential method to solve optimisation problems. However, its vast computing requirements limit its real-time and online applications, especially in embedded systems with limited computing resources, such as mobile robots ...
Jinyu Dai +5 more
doaj +1 more source
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
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
Computing a rectilinear shortest path amid splinegons in plane
, 2017 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
On Computing the Path Number of a Graph
Electronic Notes in Theoretical Computer Science, 2019 Abstract Gallai (1966) conjectured that the edge set of every graph G on n vertices can be covered by at most ⌈n/2⌉ edge-disjoint paths. Such a covering by edge-disjoint paths is called a path decomposition, and the size of a path decomposition with a minimum number of elements is called the path number of G. Peroche (1984) proved that the problem of
Fábio Botler +2 more
openaire +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
Computing Resolution-Path Dependencies in Linear Time
, 2012 The alternation of existential and universal quantifiers in a quantified boolean formula (QBF) generates dependencies among variables that must be respected when evaluating the formula. Dependency schemes provide a general framework for representing such
Slivovsky, Friedrich, Szeider, Stefan
core +1 more source
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
Algorithms for computing QoS paths with restoration [PDF]
IEEE/ACM Transactions on Networking, 2003 There is a growing interest among service providers to offer new services with quality of service (QoS) guaranties that are also resilient to failures. Supporting QoS connections requires the existence of a routing mechanism, that computes the QoS paths, i.e., paths that satisfy QoS constraints (e.g., delay or bandwidth). Resilience to failures, on the
Yigal Bejerano +4 more
openaire +2 more sources