337 search results - page 43 / 68 » Optimizing yield in global routing |
SPAA
1996
ACM
13 years 11 months ago
1996
ACM
We analyze the relationship between the expected packet delay in rooted tree networks and the distribution of time needed for a packet to cross an edge using convexity-based stoch...
FOCS
2000
IEEE
14 years 1 days ago
2000
IEEE
In many optimization problems, one seeks to allocate a limited set of resources to a set of individuals with demands. Thus, such allocations can naturally be viewed as vectors, wi...
ICCAD
1997
IEEE
13 years 12 months ago
1997
IEEE
† This paper describes a novel methodology to automate the design of the interconnect distribution for multistage clock circuits. We introduce two key ideas. First, a hierarchica...
ENDM
2002
13 years 7 months ago
2002
Motivated by a problem on message routing in communication networks, Graham and Pollak proposed a scheme for addressing the vertices of a graph G by N-tuples of three symbols in s...
ALMOB
2006
13 years 7 months ago
2006
The main goal of the motif finding problem is to detect novel, over-represented unknown signals in a set of sequences (e.g. transcription factor binding sites in a genome). The mo...