Results 11 to 20 of about 1,003,319 (338)
Computing and Listing Avoidable Vertices and Paths [PDF]
Algorithmica, 2023 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, Th. Zisis
openalex +3 more sources
Computing geodesic paths on manifolds [PDF]
Proceedings of the National Academy of Sciences, 1998 The Fast Marching Method is a numerical algorithm for solving the Eikonal equation on a rectangular orthogonal mesh in O ( M log M ) steps, where M is the total number of grid points.
Ron Kimmel, James A. Sethian
openalex +4 more sources
The computability path ordering [PDF]
Logical Methods in Computer Science, 2015 This paper aims at carrying out termination proofs for simply typed higher-order calculi automatically by using ordering comparisons. To this end, we introduce the computability path ordering (CPO), a recursive relation on terms obtained by lifting a precedence on function symbols.
Blanqui, Frédéric +2 more
openaire +7 more sources
Computational Pathology: A Path Ahead [PDF]
Archives of Pathology & Laboratory Medicine, 2015 Context We define the scope and needs within the new discipline of computational pathology, a discipline critical to the future of both the practice of pathology and, more broadly, medical practice in general. Objective To define the scope and needs
David N, Louis +15 more
openaire +2 more sources
Path computation algorithms in NS2 [PDF]
Proceedings of the First International ICST Conference on Simulation Tools and Techniques for Communications Networks and Systems, 2008 Originally designed to improve the efficiency of packets forwarding, MPLS provides support for Traffic Engineering and network resilience. Constrained-based path computation is a key building block for Traffic Engineering in MPLS networks, since it allows to set-up LSPs along paths that satisfy QoS constraints.
ADAMI, DAVIDE +3 more
openaire +1 more source
IEEE Access, 2020 In modern transportation, traffic congestion has become an urgent problem in large and medium-sized cities. In smart transportation systems, it is an effective solution to design load balancing path planning algorithms that can dynamically adapt to ...
Ning Sun +4 more
doaj +1 more source
Smoothing the path to computing [PDF]
Communications of the ACM, 2019 The Communications Web site, http://cacm.acm.org, features more than a dozen bloggers in the BLOG@CACM community. In each issue of Communications , we'll publish selected posts or excerpts. twitter Follow us on Twitter at http://twitter ...
Mary Hall +4 more
openaire +1 more source
Computing directed Steiner path covers [PDF]
Journal of Combinatorial Optimization, 2021 AbstractIn this article we consider the Directed Steiner Path Cover problem on directed co-graphs. Given a directed graph $$G=(V,E)$$ G = ( V , E ) and a set $$
Gurski, Frank +4 more
openaire +3 more sources
Gong-kuang zidonghua, 2020 In view of problems such as unreasonable path planning, slow planning speed and poor real -time performance when mine mobile robots use traditional dynamic window algorithm to plan path in complex environment, a dynamic window algorithm of mine mobile ...
LAN Shihao +3 more
doaj +1 more source
Method for reducing cloud workflow completion time under the task interruption
网络与信息安全学报, 2020 As more and more large-scale scientific workflows are delivered to clouds, the business model of workflow-as-a-service is emerging. But there are many kinds of threats in the cloud environment, which can interrupt the task execution and extend the ...
Yawen WANG, Yunfei GUO, Wenyan LIU, Shumin HUO
doaj +1 more source