Lower bounds on the power consumption in scheduled data flow graphs with resource constraints

Publisher Website

7 November 2002

conference paper
Published by Institute of Electrical and Electronics Engineers (IEEE)

https://doi.org/10.1109/date.2000.840870

Abstract

No abstract available

Keywords

This publication has 2 references indexed in Scilit:

Lower and upper bounds an the switching activity in scheduled data flow graphs
Published by Institute of Electrical and Electronics Engineers (IEEE) ,2003
An Applications Oriented Guide to Lagrangian Relaxation
Interfaces, 1985