3678 search results - page 119 / 736 » On the Stable Paths Problem |
107
click to vote
ICPPW
2002
IEEE
15 years 8 months ago
2002
IEEE
In this paper a multiple routing path problem in wide area Wavelength Division Multiplexing (WDM) networks is considered, which is to find K edge-disjoint lightpaths/semilightpat...
140
click to vote
STAIRS
2008
15 years 5 months ago
2008
We study a problem of path planning for a group of robots in this paper. The problem is stated as a finding of spatial-temporal paths through which the robots can go from their ini...
134
Voted
SIAMMA
2010
14 years 10 months ago
2010
In this paper we consider the class a functionals (introduced in [BBS]) Gr,p() defined on Lipschitz curves valued in the p-Wasserstein space. The problem considered is the followi...
114
click to vote
ICRA
2006
IEEE
15 years 9 months ago
2006
IEEE
— We consider the problem of path planning above a polyhedral terrain and present a new algorithm that for any p ≥ 1, computes a (c + ε)-approximation to the Lp-shortest path ...
130
Voted
IWPEC
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. Haplotyping via perfect phylogeny is a method for retrieving haplotypes from genotypes. Fast algorithms are known for computing perfect phylogenies from complete and erro...