3192 search results - page 140 / 639 » The minimum latency problem |
140
click to vote
JDA
2006
15 years 3 months ago
2006
Assume that each vertex of a graph G is assigned a nonnegative integer weight and that l and u are nonnegative integers. One wishes to partition G into connected components by del...
159
Voted
APPROX
2008
Springer
15 years 6 months ago
2008
Springer
We consider the variant of the minimum vertex cover problem in which we require that the cover induces a connected subgraph. We give new approximation results for this problem in d...
128
click to vote
DAC
1994
ACM
15 years 8 months ago
1994
ACM
An e cient solution to the wire sizing problem WSP usingthe Elmoredelaymodelisproposed. Two formulations of the problem are put forth: in the rst, the minimum interconnect delay i...
120
Voted
ISCAS
2005
IEEE
15 years 9 months ago
2005
IEEE
— As across-chip wire delays exceed a clock cycle, interconnect pipelining becomes essential. However, the arbitrary insertion of flip-flops can change the differentials of lat...
127
click to vote
ISSS
2000
IEEE
15 years 7 months ago
2000
IEEE
The paper presents a novel software-pipelining algorithm suitable for optimizing compilers targeting embedded VLIW processors. The proposed algorithm is different from previous ap...