1594 search results - page 43 / 319 » An Algorithm to Compute Collusion Paths |
120
click to vote
GECCO
2000
Springer
15 years 3 months ago
2000
Springer
This paper presents a genetic algorithm based method to solve the capacity and routing assignment problem arising in the design of selfhealing networks using the Virtual Path (VP)...
118
click to vote
FOCS
2007
IEEE
15 years 6 months ago
2007
IEEE
We describe a deterministic, polynomial time algorithm for finding edge-disjoint paths connecting given pairs of vertices in an expander. Specifically, the input of the algorith...
106
click to vote
GLVLSI
2000
IEEE
15 years 4 months ago
2000
IEEE
We present a new timing driven method for global placement. Our method is based on the observation that similar net length reductions in the different nets that make up a path may...
ICRA
2009
IEEE
15 years 6 months ago
2009
IEEE
— A novel criterion is introduced for assessing the diversity of a collection of paths or trajectories. The main idea is the notion of survivability, which measures the likelihoo...
AINA
2008
IEEE
15 years 6 months ago
2008
IEEE
This paper shows that the performance of peer-to-peer resource discovery algorithms is upper bounded by a k-Steiner minimum tree and proposes an algorithm locating near-optimal qu...