Sciweavers

2463 search results - page 355 / 493
» Rankings of Directed Graphs
Sort
View
DAC
2003
ACM
14 years 10 months ago
Improved global routing through congestion estimation
In this paper, we present a new method to improve global routing results. By using an amplified congestion estimate to influence a rip-up and reroute approach, we obtain substanti...
Raia Hadsell, Patrick H. Madden
DAC
2004
ACM
14 years 10 months ago
Multiple constant multiplication by time-multiplexed mapping of addition chains
An important primitive in the hardware implementations of linear DSP transforms is a circuit that can multiply an input value by one of several different preset constants. We prop...
James C. Hoe, Markus Püschel, Peter Tummeltsh...
CC
2009
Springer
153views System Software» more  CC 2009»
14 years 10 months ago
Register Spilling and Live-Range Splitting for SSA-Form Programs
Register allocation decides which parts of a variable's live range are held in registers and which in memory. The compiler inserts spill code to move the values of variables b...
Matthias Braun, Sebastian Hack
STOC
2004
ACM
131views Algorithms» more  STOC 2004»
14 years 10 months ago
(Almost) tight bounds and existence theorems for confluent flows
A flow is said to be confluent if at any node all the flow leaves along a single edge. Given a directed graph G with k sinks and non-negative demands on all the nodes of G, we con...
Jiangzhuo Chen, Robert D. Kleinberg, Lászl&...
ICSE
2007
IEEE-ACM
14 years 9 months ago
SoftGUESS: Visualization and Exploration of Code Clones in Context
We introduce SoftGUESS, a code clone exploration system. SoftGUESS is built on the more general GUESS system which provides users with a mechanism to interactively explore graph s...
Eytan Adar, Miryung Kim