Sciweavers

ISAAC
1997
Springer
114views Algorithms» more  ISAAC 1997»
13 years 11 months ago
Algorithms for Finding Optimal Disjoint Paths Around a Rectangle
We give algorithms to find the optimal disjoint paths around a rectangle. The set of disjoint paths connects a set of sources to a set of sinks (no fixed pairing between the sour...
Wun-Tat Chan, Francis Y. L. Chin
ASPDAC
2006
ACM
230views Hardware» more  ASPDAC 2006»
14 years 24 days ago
Statistical Bellman-Ford algorithm with an application to retiming
— Process variations in digital circuits make sequential circuit timing validation an extremely challenging task. In this paper, a Statistical Bellman-Ford (SBF) algorithm is pro...
Mongkol Ekpanyapong, Thaisiri Watewai, Sung Kyu Li...