196 search results - page 12 / 40 » Improving Placement under the Constant Delay Model |
CORR
2010
Springer
14 years 8 months ago
2010
Springer
Routing games are used to to understand the impact of individual users’ decisions on network efficiency. Most prior work on routing games uses a simplified model of network fl...
IJFCS
1998
14 years 9 months ago
1998
Directed acyclic graphs (dags) are often used to model circuits. Path lengths in such dags represent circuit delays. In the vertex splitting problem, the objective is to determine...
ICCAD
2002
IEEE
15 years 6 months ago
2002
IEEE
─ In this paper, we present Forge, an optimal algorithm for gate sizing using the Elmore delay model. The algorithm utilizes Lagrangian relaxation with a fast gradient-based pre-...
CORR
2007
Springer
14 years 9 months ago
2007
Springer
We consider asynchronous communication over point-to-point discrete memoryless channels without feedback. The transmitter starts sending one block codeword at an instant that is u...
ICCAD
1999
IEEE
15 years 1 months ago
1999
IEEE
We present LEOPARD, a fanout optimization algorithm based on the effort delay model for near-continuous size buffer libraries. Our algorithm minimizes area under required timing a...