485 search results - page 80 / 97 » Iterative Bounding LAO |
ICCAD
1998
IEEE
15 years 2 months ago
1998
IEEE
This paper considers simultaneous gate and wire sizing for general very large scale integrated (VLSI) circuits under the Elmore delay model. We present a fast and exact algorithm w...
LCTRTS
1998
Springer
15 years 2 months ago
1998
Springer
Abstract. Previously published methods for estimation of the worstcase execution time on contemporary processors with complex pipelines and multi-level memory hierarchies result in...
INFOCOM
1997
IEEE
15 years 2 months ago
1997
IEEE
In noncooperative networks, resources are shared among selfish users, which optimize their individual performance measure. We consider the generic and practically important case o...
ICCAD
1996
IEEE
15 years 2 months ago
1996
IEEE
We consider non-uniform wire-sizing for general routing trees under the Elmore delay model. Three minimization objectives are studied: 1) total weighted sink-delays; 2) total area...
CP
1997
Springer
15 years 2 months ago
1997
Springer
Many problems in multi-agent systems can be described as distributed Constraint Satisfaction Problems (distributed CSPs), where the goal is to nd a set of assignments to variables ...