3875 search results - page 234 / 775 » Approximation algorithms for the 0-extension problem |
154
click to vote
DAC
2009
ACM
16 years 7 months ago
2009
ACM
As VLSI technology enters the nanoscale regime, interconnect delay has become the bottleneck of the circuit timing. As one of the most powerful techniques for interconnect optimiz...
179
click to vote
NETWORKS
2011
15 years 1 months ago
2011
Abstract. We consider a basic subproblem which arises in line planning, and is of particular importance in the context of a high system load or robustness: How much can be routed m...
152
click to vote
STOC
1998
ACM
15 years 10 months ago
1998
ACM
We study integrated prefetching and caching problems following the work of Cao et. al. [3] and Kimbrel and Karlin [13]. Cao et. al. and Kimbrel and Karlin gave approximation algor...
149
click to vote
ICFP
2003
ACM
16 years 6 months ago
2003
ACM
Under the widely believed conjecture P=NP, NP-complete problems cannot be solved exactly using efficient polynomial time algorithms. Furthermore, any instance of a NP-complete pro...
157
click to vote
DCC
2002
IEEE
16 years 5 months ago
2002
IEEE
We show that the problem of optimal bit allocation among a set of independent discrete quantizers given a budget constraint is equivalent to the multiple choice knapsack problem (...