74 search results - page 7 / 15 » Maximum Flows on Disjoint Paths |
135
click to vote
ICCAD
2001
IEEE
16 years 22 days ago
2001
IEEE
Abstract: We propose an effective algorithm for power optimization in behavioral synthesis. In previous work, it has been shown that several hardware allocation/binding problems fo...
150
click to vote
ESOP
2006
Springer
15 years 7 months ago
2006
Springer
We present and solve a path optimization problem on programs. Given a set of program nodes, called critical nodes, we find a shortest path through the program's control flow g...
125
click to vote
IDA
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. We propose a generic framework and methods for simplification of large networks. The methods can be used to improve the understandability of a given network, to complemen...
160
click to vote
INFOCOM
2000
IEEE
15 years 7 months ago
2000
IEEE
Traffic engineering aims to optimize the utilization of existing network resources for load balance and failure recovery, and these are to be accomplished in a scalable fashion. Th...
143
click to vote
ICCAD
2000
IEEE
15 years 8 months ago
2000
IEEE
— Sub-micron feature sizes have resulted in a considerable portion of power to be dissipated on the buses, causing an increased attention on savings for power at the behavioral l...