434 search results - page 12 / 87 » Improved Algorithms for the 2-Vertex Disjoint Paths Problem |
118
click to vote
PPSN
2010
Springer
14 years 7 months ago
2010
Springer
The all-pairs shortest path problem is the first non-artificial problem for which it was shown that adding crossover can significantly speed up a mutation-only evolutionary algorit...
INFOCOM
2007
IEEE
15 years 3 months ago
2007
IEEE
Abstract—We present a distributed routing algorithm for finding two disjoint (primary and backup) QoS paths that run across multiple domains. Our work is inspired by the recent ...
MMB
2004
Springer
15 years 2 months ago
2004
Springer
Rate measurements are required for many purposes, e.g. for system analysis and modelling or for live systems that react to measurements. For off-line measurement all data is avail...
RSA
2000
14 years 9 months ago
2000
We analyze various stochastic processes for generating permutations almost uniformly at random in distributed and parallel systems. All our protocols are simple, elegant and are b...
ALGORITHMICA
2011
14 years 4 months ago
2011
Let V be a set of points in a d-dimensional lp-metric space. Let s, t ∈ V and let L be any real number. An L-bounded leg path from s to t is an ordered set of points which conne...