407 search results - page 27 / 82 » Recursive or iterative routing |
166
click to vote
FSTTCS
2007
Springer
16 years 7 hour ago
2007
Springer
Abstract. This paper proposes a new algorithm that improves the complexity bound for solving parity games. Our approach combines McNaughton’s iterated fixed point algorithm with...
160
click to vote
ASPDAC
2009
ACM
16 years 11 days ago
2009
ACM
— Power distribution networks (PDNs) are designed and analyzed iteratively. Random walk is among the most efficient methods for PDN analysis. We develop in this paper an increme...
155
click to vote
ICCAD
1994
IEEE
15 years 10 months ago
1994
IEEE
We consider the problem of performance driven lookup-table (LUT) based technology mapping for FPGAs using a general delay model. In the general delay model, each interconnection e...
142
Voted
VLSID
2002
IEEE
16 years 6 months ago
2002
IEEE
In this paper, we propose a hierarchical timing-driven Steiner tree algorithm for global routing which considers the minimization of timing delay during the tree construction as t...
168
click to vote
ADHOC
2008
15 years 6 months ago
2008
In this paper, we present a data aggregated maximum lifetime routing scheme for wireless sensor networks. We address the problem of jointly optimizing data aggregation and routing...