SIGN IN
SIGN UP
The datapath merging problem in reconfigurable systems: Complexity, dual bounds and heuristic evaluation
Full Text:
PDF
Get 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
2005 Article
Bibliometrics
· Citation Count: 11
· Downloads (cumulative): 437
· Downloads (12 Months): 11
· Downloads (6 Weeks): 2
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
Buy this Article
Recommend the ACM DL
to your organization
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Author Tags
algorithms
data path merging
embedded and cyber-physical systems
experimentation
heuristics
integer programming
lower bounds
real-time systems
reconfigurable computing
reconfigurable systems
self-organizing autonomic computing
Contact Us
|
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