14 search results - page 1 / 3 » On minimum reload cost paths, tours and flows |
COLOGNETWENTE
2008
13 years 6 months ago
2008
EOR
2008
13 years 5 months ago
2008
We consider the separable nonlinear and strictly convex single-commodity network flow problem (SSCNFP). We develop a computational scheme for generating a primal feasible solution...
ICCAD
2003
IEEE
14 years 1 months ago
2003
IEEE
Routing for FPGAs has been a very challenging problem due to the limitation of routing resources. Although the FPGA routing problem has been researched extensively, most algorithm...
ICCAD
2000
IEEE
13 years 9 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...
ICCAD
2001
IEEE
14 years 1 months 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...