3678 search results - page 342 / 736 » On the Stable Paths Problem |
212
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
In the oblivious buy-at-bulk network design problem in a graph, the task is to compute a fixed set of paths for every pair of source-destination in the graph, such that any set of ...
206
click to vote
ICDE
2011
IEEE
14 years 11 months ago
2011
IEEE
—In this paper, we address the problem of answering continuous route planning queries over a road network, in the presence of updates to the delay (cost) estimates of links. A si...
211
click to vote
DAM
2008
15 years 7 months ago
2008
We study a variant of the pickup-and-delivery problem (PDP) in which the objects that have to be transported can be reloaded at most d times, for a given d N. This problem is kno...
186
click to vote
ENTCS
2008
15 years 7 months ago
2008
The compositional method, introduced by Feferman and Vaught in 1959, allows to reduce the model-checking problem for a product structure to the model-checking problem for its fact...
233
click to vote
AOR
2010
15 years 5 months ago
2010
We show how a technique from signal processing known as zero-delay convolution can be used to develop more efficient dynamic programming algorithms for a broad class of stochastic...