Results 71 to 80 of about 383,111 (158)

Intriguingly Simple and Efficient Time-Dependent Routing in Road Networks [PDF]

open access: yesarXiv, 2016
We study the earliest arrival problem in road networks with static time-dependent functions as arc weights. We propose and evaluate the following simple algorithm: (1) average the travel time in k time windows, (2) compute a shortest time-independent path within each window and mark the edges in these paths, and (3) compute a shortest time-dependent ...
arxiv  

A Structural Theorem For Shortest Vertex-Disjoint Paths Computation in Planar Graphs [PDF]

open access: yes
Given k terminal pairs (s₁,t₁),(s₂,t₂),..., (s[subscript k],t[subscript k]) in an edge-weighted graph G, the k Shortest Vertex-Disjoint Paths problem is to find a collection P₁, P₂,..., P[subscript k] of vertex-disjoint paths with minimum total length ...
Zafarani, Farzad
core   +1 more source

Moderate Deviation Principle for Join-The-Shortest-Queue-d Systems [PDF]

open access: yesarXiv
The Join-the-Shortest-Queue-d routing policy is considered for a large system with $n$ servers. Moderate deviation principles (MDP) for the occupancy process and the empirical queue length process are established as $n\to \infty$. Each MDP is formulated in terms of a large deviation principle with an appropriate speed function in a suitable infinite ...
arxiv  

Computing All Shortest Passenger Routes with a Tropical Dijkstra Algorithm [PDF]

open access: yesarXiv
Given a public transportation network, which and how many passenger routes can potentially be shortest paths, when all possible timetables are taken into account? This question leads to shortest path problems on graphs with interval costs on their arcs and is closely linked to multi-objective optimization.
arxiv  

Exploring the transmission of cognitive task information through optimal brain pathways. [PDF]

open access: yesPLoS Comput Biol
Wang Z   +6 more
europepmc   +1 more source

Home - About - Disclaimer - Privacy