3678 search results - page 13 / 736 » On the Stable Paths Problem |
111
click to vote
SIGCOMM
2006
ACM
15 years 9 months ago
2006
ACM
Traditional studies of routing problems often assumed strict preferences on paths, by eliminating ambiguity in path comparisons, or imposing a priori deterministic tie-breaking. S...
118
click to vote
TIT
2010
14 years 10 months ago
2010
Abstract--Glass models are frequently used to model gene regulatory networks. A distinct feature of the Glass model is that its dynamics can be formalized as paths through multi-di...
151
Voted
DAM
2002
15 years 3 months ago
2002
We consider the stable marriage problem where participants are permitted to express indifference in their preference lists (i.e., each list can be partially ordered). We prove tha...
107
click to vote
DAM
2008
15 years 3 months ago
2008
In this paper we solve several recurrence relations with two (three) indices using combinatorial methods. Moreover, we present several recurrence relations with two (three) indice...
110
click to vote
CPAIOR
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. Recently, new cost-based filtering algorithms for shorter-path constraints have been developed. However, so far only the theoretical properties of shorter-path constrain...