3678 search results - page 138 / 736 » On the Stable Paths Problem |
93
Voted
ICDE
2010
IEEE
15 years 1 months ago
2010
IEEE
Abstract— Nowadays, vast amount of routing data, like sequences of points of interests, landmarks, etc., are available due to the proliferation of geodata services. We refer to t...
102
click to vote
EOR
2006
15 years 1 months ago
2006
: This paper addresses the problem of computing minimum risk paths by taking as objective the expected accident cost. The computation is based on a dynamic programming formulation ...
100
Voted
DATE
2009
IEEE
15 years 7 months ago
2009
IEEE
—We propose a new methodology based on Mixed Integer Linear Programming (MILP) for determining the input values that will exercise a specified execution path in a program. In or...
IFIP
2004
Springer
15 years 6 months ago
2004
Springer
We consider the problem of computing the optimal swap edges of a shortest-path tree. This theoretical problem arises in practice in systems that offer point-offailure shortest-path...
118
Voted
INFOCOM
1999
IEEE
15 years 5 months ago
1999
IEEE
We investigate the problem of optimal resource allocation for end-to-end QoS requirements on unicast paths and multicast trees. Specifically, we consider a framework in which reso...