SIGN IN
SIGN UP
A binary-constraint search algorithm for minimizing hardware during hardware/software partitioning
Full Text:
PDF
Buy this Article
Authors:
Frank Vahid
Department of Computer Science, University of California, Riverside, CA and Department of Information and Computer Science, University of California, Irvine, CA
Daniel D. Gajski
Department of Information and Computer Science, University of California, Irvine, CA
Jie Gong
Department of Information and Computer Science, University of California, Irvine, CA
Published in:
· Proceeding
EURO-DAC '94 Proceedings of the conference on European design automation
Pages 214-219
IEEE Computer Society Press
Los Alamitos, CA
, USA
©1994
table of contents
ISBN:0-89791-685-9
1994 Article
Bibliometrics
· Downloads (6 Weeks): 5
· Downloads (12 Months): 35
· Downloads (cumulative): 343
· Citation Count: 44
Tools and Resources
Buy this Article
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
DAC '13
Share:
|
Tags:
algorithms
experimentation
hardware/software interfaces
performance
sorting and searching
theory
verification
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder