Results 171 to 180 of about 391,490 (227)

K-Shortest-Path-Based Evacuation Routing with Police Resource Allocation in City Transportation Networks. [PDF]

PLoS One, 2015
He Y, Liu Z, Shi J, Wang Y, Zhang J, Liu J.   +5 more
europepmc   +1 more source

Shortest Path Routing Using Heuristic Search [PDF]

, 2006
Alaiwan, Ahmed Omran A.
openalex  

Learning to Decompose: Human-Like Subgoal Preferences Emerge in Neural Networks Learning Graph Traversal. [PDF]

Open Mind (Camb)
Li Y, McClelland JL.
europepmc   +1 more source

Reinforcement Learning-Based Intelligent Path Planning for Optimal Navigation in Dynamic Environments. [PDF]

Neural Process Lett
Yadav AK, Sharma P, Cheng X, Shukla SSP.
europepmc   +1 more source

Automatic selection of generating nodes in the traffic model based on k shortest paths

, 2009
P. Kanadys, A. Żochowski
openalex   +1 more source

When Droplets Can "Think": Intelligent Testing in Digital Microfluidic Chips. [PDF]

Biosensors (Basel)
Luo Z, Li S, Long W, Chen R, Zheng J.
europepmc   +1 more source

White Matter Structural Network Dysfunction Mediates the Effect of Hypertension on Cognitive Decline in Parkinson Disease. [PDF]

Neurologist
Shu L, Li S, Lin L, Yu Y, Liao B, Lu T.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

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

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