3678 search results - page 107 / 736 » On the Stable Paths Problem |
ICCS
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. The reliability problem of the quickest path deals with the transmission of a message of sizeσ from a source to a destination with both the minimum end-to-end delay and ...
75
Voted
CDC
2008
IEEE
15 years 7 months ago
2008
IEEE
— In this paper we explore the stabilization of closed invariant sets for passive systems, and present conditions under which a passivity-based feedback makes the set stable, sem...
106
click to vote
ICOIN
2001
Springer
15 years 5 months ago
2001
Springer
This paper investigates the problem of path calcul ation of multiple metric routing. Toda ’s Internet routing is based on a single metric path selecting algorithm. Single metric...
105
Voted
DISOPT
2006
15 years 24 days ago
2006
This paper gives a sufficient condition for a combinatorial problem to be greedy-type-resistant, i.e. such that, on some instances of the problem, any greedy-type algorithm will o...
103
Voted
AMC
2005
15 years 20 days ago
2005
In this paper, we present an application of 0-1 linear programming problem in the indentification of the nondominated paths on a network. To find efficient paths, an adaptationof t...