"A branch-and-bound method for optimal transformation of data flow graphs ..."

Werner Grass (1990)

> Home

Details and statistics

DOI: 10.1109/EDAC.1990.136623

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-24

- view
  authority control:
- export record
  dblp key:
  - conf/eurodac/Grass90
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/eurodac/Grass90
Werner Grass:
A branch-and-bound method for optimal transformation of data flow graphs for observing hardware constraints. EURO-DAC 1990: 73-77

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.