Dynamic Programming and Transitive Closure on Linear Pipelines.
MARYLAND UNIV COLLEGE PARK CENTER FOR AUTOMATION RESEARCH
Pagination or Media Count:
Algorithms for the dynamic programming and transitive closure problems are presented for a linear pipeline of processors. These algorithms require only a constant number of inputoutput ports and are optimal in their area and time requirements. Author
- Electrical and Electronic Equipment
- Theoretical Mathematics
- Computer Hardware