Results 1  10
of
398,201
Online Computation of Fastest Path in TimeDependent Spatial Networks
, 2011
"... The problem of pointtopoint fastest path computation in static spatial networks is extensively studied with many precomputation techniques proposed to speedup the computation. Most of the existing approaches make the simplifying assumption that traveltimes of the network edges are constant. Howe ..."
Abstract

Cited by 8 (5 self)
 Add to MetaCart
. However, with realworld spatial networks the edge traveltimes are timedependent, where the arrivaltime to an edge determines the actual traveltime on the edge. In this paper, we study the online computation of fastest path in timedependent spatial networks and present a technique which speeds
C.: A case for timedependent shortest path computation in spatial networks
 In: Proc. of the SIGSPATIAL Intl. Conf. on Advances in GIS
, 2010
"... The problem of pointtopoint shortest path computation in spatial networks is extensively studied with many approaches proposed to speedup the computation. Most of the existing approaches make the simplifying assumption that weights (e.g., traveltime) of the network edges are constant. However, w ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
evaluate the importance of considering timedependent edge traveltimes for route planning in spatial networks. We show that timedependent shortest path computation can reduce the traveltime by 36 % on average as compared to the static shortest path computation that assumes constant edge traveltimes
Stochastic TimeDependent Networks
, 2004
"... A stochastic timedependent (STD) network is defined by treating all link travel times at all time periods as random variables, with possible timewise and linkwise stochastic dependency. A routing policy is a decision rule which specifies what node to take next out of the current node based on the ..."
Abstract
 Add to MetaCart
A stochastic timedependent (STD) network is defined by treating all link travel times at all time periods as random variables, with possible timewise and linkwise stochastic dependency. A routing policy is a decision rule which specifies what node to take next out of the current node based
Understanding FaultTolerant Distributed Systems
 COMMUNICATIONS OF THE ACM
, 1993
"... We propose a small number of basic concepts that can be used to explain the architecture of faulttolerant distributed systems and we discuss a list of architectural issues that we find useful to consider when designing or examining such systems. For each issue we present known solutions and design ..."
Abstract

Cited by 374 (23 self)
 Add to MetaCart
We propose a small number of basic concepts that can be used to explain the architecture of faulttolerant distributed systems and we discuss a list of architectural issues that we find useful to consider when designing or examining such systems. For each issue we present known solutions and design alternatives, we discuss their relative merits and we give examples of systems which adopt one approach or the other. The aim is to introduce some order in the complex discipline of designing and understanding faulttolerant distributed systems.
Further Computational Results on Fastest Paths in Stochastic TimeDependent Networks
, 1997
"... Dijkstra's algorithm may be used to compute fastest paths in transportation networks represented as weighted graphs where edge weights denote travel times between locations. If travel times are both stochastic and time dependent, however, efficient dynamic programming methods cannot be used to ..."
Abstract
 Add to MetaCart
to compute fastest paths. Wellman et al. introduced a variant of priorityfirst search that is capable of finding optimal paths in stochastic timedependent networks (STDNs). This paper presents new computational results on the performance of Wellman's algorithm on a class of randomly generated STDNs
Network Centric Warfare: Developing and Leveraging Information Superiority
 Command and Control Research Program (CCRP), US DoD
, 2000
"... the mission of improving DoD’s understanding of the national security implications of the Information Age. Focusing upon improving both the state of the art and the state of the practice of command and control, the CCRP helps DoD take full advantage of the opportunities afforded by emerging technolo ..."
Abstract

Cited by 308 (5 self)
 Add to MetaCart
the mission of improving DoD’s understanding of the national security implications of the Information Age. Focusing upon improving both the state of the art and the state of the practice of command and control, the CCRP helps DoD take full advantage of the opportunities afforded by emerging technologies. The CCRP pursues a broad program of research and analysis in information superiority, information operations, command and control theory, and associated operational concepts that enable us to leverage shared awareness to improve the effectiveness and efficiency of assigned missions. An important aspect of the CCRP program is its ability to serve as a bridge between the operational, technical, analytical, and educational communities. The CCRP provides leadership for the command and control research community by: n n
PointtoPoint Shortest Paths on Dynamic TimeDependent Road Networks
, 2009
"... The computation of pointtopoint shortest paths on timedependent road networks has many practical applications which are interesting from an industrial point of view. Typically, users are interested in the path leading to their destination which has the smallest travel time among all possible path ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
The computation of pointtopoint shortest paths on timedependent road networks has many practical applications which are interesting from an industrial point of view. Typically, users are interested in the path leading to their destination which has the smallest travel time among all possible
Finding fastest paths on a road network with speed patterns
 In Proc. Int. Conf. on Data Engineering (ICDE’06
, 2006
"... This paper proposes and solves the TimeInterval All Fastest Path (allFP) query. Given a userdefined leaving or arrival time interval I, a source node s and an end node e, allFP asks for a set of all fastest paths from s to e, one for each subinterval of I. Note that the query algorithm should fin ..."
Abstract

Cited by 45 (0 self)
 Add to MetaCart
This paper proposes and solves the TimeInterval All Fastest Path (allFP) query. Given a userdefined leaving or arrival time interval I, a source node s and an end node e, allFP asks for a set of all fastest paths from s to e, one for each subinterval of I. Note that the query algorithm should
Efficient KNearest Neighbor Search in TimeDependent Spatial Networks
, 2010
"... The class of k Nearest Neighbor (kNN) queries in spatial networks has been widely studied in the literature. All existing approaches for kNN search in spatial networks assume that the weight (e.g., traveltime) of each edge in the spatial network is constant. However, in realworld, edgeweights a ..."
Abstract

Cited by 11 (1 self)
 Add to MetaCart
) and Loose Network Index (LNI) to minimize the number of candidate nearest neighbor objects and, hence, reduce the invocation of the expensive fastestpath computation in timedependent spatial networks. We demonstrate the efficiency of our proposed solution via experimental evaluations with realworld data
Results 1  10
of
398,201