3678 search results - page 236 / 736 » On the Stable Paths Problem |
155
Voted
NETWORKS
2006
15 years 5 months ago
2006
We are given a directed network G = (V, A, u) with vertex set V , arc set A, a source vertex s V , a destination vertex t V , a finite capacity vector u = {uij}ijA, and a positi...
120
click to vote
SIAMJO
2002
15 years 4 months ago
2002
A probability-one homotopy algorithm for solving nonsmooth equations is described. This algorithm is able to solve problems involving highly nonlinear equations, where the norm of ...
171
click to vote
TPDS
2002
15 years 4 months ago
2002
One of the most fundamental problems automatic parallelization tools are confronted with is to find an optimal domain decomposition for a given application. For regular domain prob...
153
click to vote
SAC
2005
ACM
15 years 10 months ago
2005
ACM
In parallel and distributed processing, tasks are ordinarily clustered and assigned to different processors or machines before they are scheduled. The assignment of tasks to proc...
173
Voted
ALGORITHMICA
2006
15 years 5 months ago
2006
We provide combinatorial algorithms for the unsplittable flow problem (UFP) that either match or improve the previously best results. In the UFP we are given a (possibly directed)...