Results 11 to 20 of about 989,695 (238)
Computing Homotopic Shortest Paths Efficiently [PDF]
Computational Geometry, 2002 12 pages, 11 ...
Alon Efrat, Stephen Kobourov, Anna Lubiw
openalex +6 more sources
The computability path ordering: the end of a quest [PDF]
, 2008 Dans CSL'08 (2008)
Frédéric Blanqui +2 more
openalex +6 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.
Frédéric Blanqui +3 more
openaire +9 more sources
Reconfigurable Computing for Tool-Path Computation [PDF]
The International Journal of Advanced Manufacturing Technology, 2003 Tool path generation is one of the most complex problems in Computer Aided Manufacturing. Although some efficient strategies have been developed to solve it, most of them are only useful for 3 and 5 axis standard machining. The algorithm called Virtual Digitising computes the tool path by means of a “virtually digitised” model of the surface and a ...
Jimeno Morenilla, Antonio +1 more
openaire +2 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
openaire +3 more sources
Physarum can compute shortest paths [PDF]
Journal of Theoretical Biology, 2012 Physarum Polycephalum is a slime mold that is apparently able to solve shortest path problems. A mathematical model has been proposed by biologists to describe the feedback mechanism used by the slime mold to adapt its tubular channels while foraging two food sources s0 and s1.
Bonifaci V, Mehlhorn K, Varma G
openaire +9 more sources
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
New Paths for Computing Humanists [PDF]
Digital Studies/Le champ numérique, 2009 <p>Digital Humanities is now successfully established as an inter-discipline with local, national, and international import, and remains a vibrant pursuit because of its position at the intersection of fast-paced advances in computation and their application to the traditional pursuits of the humanities. As a point of intersection between the two,
Siemens, Ray, Shawver, Gary
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
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
John R. Gilbertson +15 more
openaire +2 more sources