Sciweavers

552 search results - page 7 / 111
» Constrained Shortest Path Computation
Sort
View
108
Voted
PVLDB
2010
269views more  PVLDB 2010»
14 years 10 months ago
Shortest Path Computation on Air Indexes
Shortest path computation is one of the most common queries in location-based services that involve transportation networks. Motivated by scalability challenges faced in the mobil...
Georgios Kellaris, Kyriakos Mouratidis
CDC
2009
IEEE
126views Control Systems» more  CDC 2009»
14 years 10 months ago
Stochastic optimization for Markov modulated networks with application to delay constrained wireless scheduling
Abstract-- We consider a wireless system with a small number of delay constrained users and a larger number of users without delay constraints. We develop a scheduling algorithm th...
Michael J. Neely
GIS
2010
ACM
14 years 11 months ago
A case for time-dependent shortest path computation in spatial networks
The problem of point-to-point shortest path computation in spatial networks is extensively studied with many approaches proposed to speed-up the computation. Most of the existing ...
Ugur Demiryurek, Farnoush Banaei Kashani, Cyrus Sh...
116
Voted
CORR
2010
Springer
136views Education» more  CORR 2010»
14 years 10 months ago
Delay-Constrained Multicast Routing Algorithm Based on Average Distance Heuristic
Multicast is the ability of a communication network to accept a single message from an application and to deliver copies of the message to multiple recipients at different locatio...
Ling Zhou, Wei-xiong Ding, Yu-xi Zhu
CAINE
2004
15 years 1 months ago
An Architecture for a Hardware Implementation of the OSPF Protocol
The problem of finding a shortest path is common to many different fields including transportation systems, mechanical systems and computer communications. Most telecommunication ...
Mohamed Abou-Gabal, Raymond Peterkin, Dan Ionescu