854 search results - page 78 / 171 » A General Vehicle Routing Problem |
156
click to vote
SIGECOM
2005
ACM
15 years 11 months ago
2005
ACM
In multi-hop networks, the actions taken by individual intermediate nodes are typically hidden from the communicating endpoints; all the endpoints can observe is whether or not th...
179
click to vote
WAOA
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. Many online problems encountered in real-life involve a twostage decision process: upon arrival of a new request, an irrevocable firststage decision (the assignment of a...
180
click to vote
SPAA
2003
ACM
15 years 11 months ago
2003
ACM
In the minimum path coloring problem, we are given a graph and a set of pairs of vertices of the graph and we are asked to connect the pairs by colored paths in such a way that pa...
183
click to vote
MASCOTS
2008
15 years 7 months ago
2008
A key obstacle to large-scale network simulation over PC clusters is the memory balancing problem where a memory-overloaded machine can slow down an entire simulation due to disk ...
159
click to vote
INFOCOM
2002
IEEE
15 years 11 months ago
2002
IEEE
This paper concerns itself with the performance of deflection routing in optical burst-switched networks based on Just-Enough-Time (JET) signaling. Generally speaking, buffer requi...