2343 search results - page 141 / 469 » The Locomotive Routing Problem |
158
click to vote
INFOCOM
1998
IEEE
15 years 10 months ago
1998
IEEE
We consider the problem of routing connections with quality of service (QoS) requirements across networks when the information available for making routing decisions is inaccurate....
179
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
We investigate optimal routing and scheduling strategies for multi-hop wireless networks with rateless codes. Rateless codes allow each node of the network to accumulate mutual in...
175
click to vote
WAOA
2004
Springer
15 years 11 months ago
2004
Springer
SONET add-drop multiplexers (ADMs) are the dominant cost factor in SONET /WDM rings. The number of SONET ADMs required by a set of traffic streams is determined by the routing and...
154
click to vote
FOCS
1996
IEEE
15 years 10 months ago
1996
IEEE
In the minimum path coloring problem, we are given a list of pairs of vertices of a graph. We are asked to connect each pair by a colored path. Paths of the same color must be edg...
149
click to vote
SODA
2001
ACM
15 years 7 months ago
2001
ACM
In the bus network problem, the goal is to generate a plan for getting from point X to point Y within a city using buses in the smallest expected time. Because bus arrival times a...