"Lower Bounds on the Power Consumption in Scheduled Data Flow Graphs with ..."

Lars Kruse et al. (2000)

> Home

Details and statistics

DOI: 10.1109/DATE.2000.840870

access: closed

type: Conference or Workshop Paper

metadata version: 2023-03-24

- view
  authority control:
- export record
  dblp key:
  - conf/date/KruseSJSN00
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/date/KruseSJSN00
Lars Kruse, Eike Schmidt, Gerd Jochens, Ansgar Stammermann, Wolfgang Nebel:
Lower Bounds on the Power Consumption in Scheduled Data Flow Graphs with Resource Constraints. DATE 2000: 737

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.