Results 31 to 40 of about 391,490 (227)
A Novel Method for Solving Multi-objective Shortest Path Problem in Respect of Probability Theory
Transportation process or activity can be considered as a multi-objective problem reasonably. However, it is difficult to obtain an absolute shortest path with optimizing the multiple objectives at the same time by means of Pareto approach. In this paper,
Maosheng Zheng, Jie Yu
doaj +1 more source
The shortest cut in brane cosmology [PDF]
We consider brane cosmology studying the shortest null path on the brane for photons, and in the bulk for gravitons. We derive the differential equation for the shortest path in the bulk for a 1+4 cosmological metric.
A. Davis +29 more
core +3 more sources
A Load Balancing Shortest Path Routing Algorithm for SRIO Network [PDF]
Routing selection algorithms are one of the important factors affecting transmission performance during serial RapidIO transmission.Aiming at the non-optimal allocation path of Serial Rapid Input and Output(SRIO) network depth search,this paper proposes ...
LI Jiawei, ZHANG Ji, ZHAO Juncai, DING Ruyi
doaj +1 more source
Generalized Shortest Path Kernel on Graphs
We consider the problem of classifying graphs using graph kernels. We define a new graph kernel, called the generalized shortest path kernel, based on the number and length of shortest paths between nodes.
A Fronczak +6 more
core +1 more source
The minimum energy expenditure shortest path method [PDF]
This article discusses the addition of an energy parameter to the shortest path execution process; namely, the energy expenditure by a character during execution of the path.
Choset H. +14 more
core +1 more source
Computing a rectilinear shortest path amid splinegons in plane
We reduce the problem of computing a rectilinear shortest path between two given points s and t in the splinegonal domain \calS to the problem of computing a rectilinear shortest path between two points in the polygonal domain. As part of this, we define
DP Dobkin +16 more
core +1 more source
Maritime Transport Network in Korea: Spatial-Temporal Density and Path Planning
The increase in maritime traffic and vessel size has strengthened the need for economical and safe maritime transportation networks. Currently, ship path planning is based on past experience and shortest route usage. However, the increasing complexity of
Jeong-Seok Lee +2 more
doaj +1 more source
Speeding up shortest path algorithms
Given an arbitrary, non-negatively weighted, directed graph $G=(V,E)$ we present an algorithm that computes all pairs shortest paths in time $\mathcal{O}(m^* n + m \lg n + nT_\psi(m^*, n))$, where $m^*$ is the number of different edges contained in ...
A.V. Goldberg +10 more
core +1 more source
Stochastic Shortest Path Games [PDF]
Summary: We consider dynamic, two-player, zero-sum games where the ``minimizing'' player seeks to drive an underlying finite-state dynamic system to a special terminal state along a least expected cost path. The ``maximizer'' seeks to interfere with the minimizer's progress so as to maximize the expected total cost.
Patek, Stephen D., Bertsekas, Dimitri P.
openaire +1 more source
Reconfiguring Shortest Paths in Graphs
AbstractReconfiguring two shortest paths in a graph means modifying one shortest path to the other by changing one vertex at a time so that all the intermediate paths are also shortest paths. This problem has several natural applications, namely: (a) repaving road networks, (b) rerouting data packets in a synchronous multiprocessing setting, (c) the ...
Gajjar, Kshitij +3 more
openaire +3 more sources

