The datapath merging problem in reconfigurable systems: Complexity, dual bounds and heuristic evaluation

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Cid C. de Souza Universidade Estadual de Campinas, SP, Brazil
Andre M. Lima Universidade Estadual de Campinas, SP, Brazil
Guido Araujo Universidade Estadual de Campinas, SP, Brazil
Nahri B. Moreano Universidade Federal de Mato Grosso do Sul, MS, Brazil
The datapath merging problem in reconfigurable systems: Complexity, dual bounds and heuristic evaluation Published by ACM 2005 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 3
· Downloads (12 Months): 39
· Downloads (cumulative): 373
· Citation Count: 9

Published in:
· Journal
Journal of Experimental Algorithmics (JEA) JEA Homepage archive
Volume 10, 2005
Article No. 2.2
ACM New York, NY, USA
table of contents doi>10.1145/1064546.1180613

Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder