567 search results - page 57 / 114 » Exact train pathing |
CCCG
2009
15 years 29 days ago
2009
We study a maximum flow problem in a polygonal domain P: Determine the maximum number of disjoint "thick" paths (of specified width w) through P from a source edge to a ...
113
click to vote
CORR
2008
Springer
14 years 12 months ago
2008
Springer
The underwater acoustic channel is characterized by a path loss that depends not only on the transmission distance, but also on the signal frequency. As a consequence, transmission...
106
click to vote
EOR
2007
14 years 11 months ago
2007
This paper studies an arc routing problem with capacity constraints and time-dependent service costs. This problem is motivated by winter gritting applications where the ‘‘tim...
100
click to vote
TELSYS
2008
14 years 11 months ago
2008
This paper investigates connectivity in one-dimensional ad hoc networks by means of the distribution of the minimum hop count between source and destination nodes. We derive the ex...
CCR
2000
14 years 11 months ago
2000
We propose an enhancement to TCP's error recovery scheme, which we call the Eifel algorithm. It eliminates the retransmission ambiguity, thereby solving the problems caused b...