Sciweavers

24 search results - page 4 / 5
» Undirected Single Source Shortest Path in Linear Time
Sort
View
ICALP
1998
Springer
13 years 11 months ago
Static and Dynamic Low-Congested Interval Routing Schemes
Interval Routing Schemes (IRS for short) have been extensively investigated in the past years with special emphasis on shortest paths. Besides their theoretical interest, IRS have...
Serafino Cicerone, Gabriele Di Stefano, Michele Fl...
ESA
2010
Springer
185views Algorithms» more  ESA 2010»
13 years 8 months ago
Fast Routing in Very Large Public Transportation Networks Using Transfer Patterns
We show how to route on very large public transportation networks (up to half a billion arcs) with average query times of a few milliseconds. We take into account many realistic fe...
Hannah Bast, Erik Carlsson, Arno Eigenwillig, Robe...
ICC
2009
IEEE
145views Communications» more  ICC 2009»
13 years 5 months ago
End-to-End Delay Approximation in Cascades of Generalized Processor Sharing Schedulers
Abstract This paper proposes an analytical method to evaluate the delay violation probability of traffic flows with statistical Quality-of-Service (QoS) guarantees in a Generalize...
Paolo Giacomazzi, Gabriella Saddemi
MOBIHOC
2002
ACM
14 years 7 months ago
Path set selection in mobile ad hoc networks
Topological changes in mobile ad hoc networks frequently render routing paths unusable. Such recurrent path failures have detrimental effects on the network ability to support QoS...
Emin Gün Sirer, Panagiotis Papadimitratos, Zy...
PDPTA
2007
13 years 8 months ago
Two Graph Algorithms On an Associative Computing Model
- The MASC (for Multiple Associative Computing) model is a SIMD model enhanced with associative properties and multiple synchronous instruction streams (IS). A number of algorithms...
Mingxian Jin, Johnnie W. Baker