4342 search results - page 579 / 869 » Improved Algorithms for Optimal Embeddings |
169
click to vote
INTEGRATION
2007
15 years 6 months ago
2007
In this paper, we propose an efficient algorithm to reduce the voltage noises for on-chip power/ground (P/G) networks of VLSI. The new method is based on the sequence of linear p...
180
click to vote
STOC
1996
ACM
15 years 11 months ago
1996
ACM
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...
172
click to vote
ICCAD
2008
IEEE
16 years 3 months ago
2008
IEEE
— This paper presents a fast analytical method for estimating the throughput of pipelined asynchronous systems, and then applies that method to develop a fast solution to the pro...
191
click to vote
IEEEPACT
2008
IEEE
16 years 1 months ago
2008
IEEE
This work proposes and evaluates improvements to previously known algorithms for redundancy elimination. Enhanced Scalar Replacement combines two classic techniques, scalar replac...
189
click to vote
FOCS
2004
IEEE
15 years 10 months ago
2004
IEEE
We consider a stochastic variant of the NP-hard 0/1 knapsack problem in which item values are deterministic and item sizes are independent random variables with known, arbitrary d...