203 search results - page 22 / 41 » An O(nlogn) time algorithm for optimal buffer insertion |
265
click to vote
VLDB
2005
ACM
16 years 5 months ago
2005
ACM
Abstract. In this paper we present new concurrent and recoverable B-link-tree algorithms. Unlike previous algorithms, ours maintain the balance of the B-link tree at all times, so ...
165
click to vote
CCCG
2010
15 years 7 months ago
2010
The Polar Diagram [1] of a set of points (i.e. sites) is a partition of the plane. It is a locus approach for problems processing angles. Also, Dynamic Polar Diagram problem is a ...
157
click to vote
DATE
2008
IEEE
15 years 12 months ago
2008
IEEE
Sleep transistor insertion is one of today’s most promising and widely adopted solutions for controlling stand-by leakage power in nanometer circuits. Although single-cycle powe...
147
click to vote
ASPDAC
2007
ACM
15 years 9 months ago
2007
ACM
Parallel prefix adder is the most flexible and widely-used binary adder for ASIC designs. Many high-level synthesis techniques have been developed to find optimal prefix structures...
154
click to vote
DATE
2009
IEEE
16 years 7 days ago
2009
IEEE
—Scheduling task graphs under hard (end-to-end) timing constraints is an extensively studied NP-hard problem of critical importance for predictable software mapping on Multiproce...