169 search results - page 17 / 34 » Counting paths in digraphs |
127
click to vote
ATMOS
2007
15 years 3 months ago
2007
In railways systems the timetable is typically represented as a weighted digraph on which itinerary queries are answered by shortest path algorithms, usually running Dijkstra’s a...
103
Voted
ANOR
2005
15 years 1 months ago
2005
Sensors are used to monitor traffic in networks. For example, in transportation networks, they may be used to measure traffic volumes on given arcs and paths of the network. This p...
124
click to vote
IMC
2009
ACM
15 years 8 months ago
2009
ACM
We show that currently prevalent practices for network path measurements can produce inaccurate inferences because of sampling biases. The inferred mean path latency can be more t...
TON
2002
15 years 1 months ago
2002
In this paper we introduce and investigate a new" path optimization problem which we denote as the All Hops Optimal Path AHOP problem. The problem involves identifying, for a...
108
click to vote
MOBICOM
2003
ACM
15 years 7 months ago
2003
ACM
This paper presents the expected transmission count metric (ETX), which finds high-throughput paths on multi-hop wireless networks. ETX minimizes the expected total number of pac...