Results 261 to 270 of about 1,848,326 (324)

Fully memristive spiking neural network for energy-efficient graph learning. [PDF]

Sci Adv
Shi T, Gao L, Zhou R, Tian Y, Chen P, Ding Y, Tang S, Ma H, Lu J, Zhang H, Wang Z, Lyu B, Zhang X, Yan X, Liu Q.   +14 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Querying Shortest Paths on Time Dependent Road Networks

Proceedings of the VLDB Endowment, 2019
For real-world time dependent road networks (TDRNs), answering shortest path-based route queries and plans in real-time is highly desirable by many industrial applications.
Yong Wang, Guoliang Li, N. Tang
semanticscholar   +1 more source

Finding Top-k Shortest Paths with Diversity

IEEE Transactions on Knowledge and Data Engineering, 2018
The classical K Shortest Paths (KSP) problem, which identifies the $k$ shortest paths in a directed graph, plays an important role in many application domains, such as providing alternative paths for vehicle routing services.
Huiping Liu, Cheqing Jin, B. Yang, Aoying Zhou   +3 more
semanticscholar   +1 more source

SHORTEST PATHS ON A POLYHEDRON, Part I: COMPUTING SHORTEST PATHS

International Journal of Computational Geometry & Applications, 1996
We present an algorithm for determining the shortest path between any two points along the surface of a polyhedron which need not be convex. This algorithm also computes for any source point on the surface of a polyhedron the inward layout and the subdivision of the polyhedron which can be used for processing queries of shortest paths between the ...
Chen, Jindong, Han, Yijie
openaire   +1 more source

Unpaired Image-to-Image Translation with Shortest Path Regularization

Computer Vision and Pattern Recognition, 2023
Unpaired image-to-image translation aims to learn proper mappings that can map images from one domain to another domain while preserving the content of the input image. However, with large enough capacities, the network can learn to map the inputs to any
Shaoan Xie, Yanwu Xu, Mingming Gong, Kun Zhang   +3 more
semanticscholar   +1 more source

Shortest Path Algorithms

2008
Shortest path problems are fundamental network optimization problems arising in many contexts and having a wide range of applications, including dynamic programming, project management, knapsack problems, routing in data networks, and transportation problems.
openaire   +2 more sources

Dynamic shortest‐path interdiction

Networks, 2016
We study a dynamic network game between an attacker and a user. The user wishes to find a shortest path between a pair of nodes in a directed network, and the attacker seeks to interdict a subset of arcs to maximize the user's shortest‐path cost. In contrast to most previous studies, the attacker can interdict arcs any time the user reaches a node in ...
Sefair, Jorge A., Smith, J. Cole
openaire   +1 more source

Approximation of Distances and Shortest Paths in the Broadcast Congest Clique

International Conference on Principles of Distributed Systems, 2014
We study the broadcast version of the CONGEST CLIQUE model of distributed computing. In this model, in each round, any node in a network of size $n$ can send the same message (i.e.
S. Holzer, N. Pinsker
semanticscholar   +1 more source

Shortest Paths with Shortest Detours

Journal of Optimization Theory and Applications, 2017
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Carolin Torchiani, Jan Ohst, David Willems, Stefan Ruzika   +3 more
openaire   +1 more source

Shortest paths in euclidean graphs

Algorithmica, 1986
We analyze a simple method for finding shortest paths in Euclidean graphs (where vertices are points in a Euclidean space and edge weights are Euclidean distances between points). For many graph models, the average running time of the algorithm to find the shortest path between a specified pair of vertices in a graph with V vertices and E edges is ...
Sedgewick, Robert, Vitter, Jeffrey Scott
openaire   +1 more source