1768 search results - page 338 / 354 » Optimal routing in Chord |
111
click to vote
JSAC
2010
14 years 6 months ago
2010
Abstract--The continuously increasing complexity of communication networks and the increasing diversity and unpredictability of traffic demand has led to a consensus view that the ...
110
click to vote
SIAMDM
2010
14 years 6 months ago
2010
We consider the following network design problem. We are given an undirected network with costs on the edges, a set of terminals, and an upper bound for each terminal limiting the ...
DAC
2009
ACM
16 years 23 days ago
2009
ACM
In this paper, we propose an effective algorithm flow to handle largescale mixed-size placement. The basic idea is to use floorplanning to guide the placement of objects at the gl...
DAC
2008
ACM
16 years 23 days ago
2008
ACM
In this paper, we present ELIAD, an efficient lithography aware detailed router to optimize silicon image after optical proximity correction (OPC) in a correct-by-construction man...
DAC
2006
ACM
16 years 22 days ago
2006
ACM
As a prevalent constraint, sharp slew rate is often required in circuit design which causes a huge demand for buffering resources. This problem requires ultra-fast buffering techn...