3678 search results - page 188 / 736 » On the Stable Paths Problem |
106
click to vote
HPCA
1999
IEEE
15 years 8 months ago
1999
IEEE
Processors that can simultaneously execute multiple paths of execution will only exacerbate the fetch bandwidth problem already plaguing conventional processors. On a multiple-pat...
121
click to vote
VISSYM
2007
15 years 6 months ago
2007
For displaying a dense graph, an adjacency matrix is superior than a node-link diagram because it is more compact and free of visual clutter. A node-link diagram, however, is far ...
120
click to vote
DAIS
2003
15 years 5 months ago
2003
Communication in distributed applications across a wide area network needs to cope with heterogenous and constantly changing network conditions. A promising approach to address thi...
139
click to vote
GIS
2010
ACM
15 years 2 months ago
2010
ACM
The problem of point-to-point shortest path computation in spatial networks is extensively studied with many approaches proposed to speed-up the computation. Most of the existing ...
136
click to vote
EOR
2007
15 years 3 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...