1550 search results - page 196 / 310 » Benchmarking for Graph Transformation |
102
Voted
ISLPED
1996
ACM
15 years 4 months ago
1996
ACM
We present a dynamic programming technique for solving the multiple supply voltage scheduling problem in both nonpipelined and functionally pipelined data-paths. The scheduling pro...
105
Voted
DAC
1994
ACM
15 years 4 months ago
1994
ACM
We address the problem of obtaining good variable orderings for the BDD representation of a system of interacting finite state machines (FSMs). Orderings are derived from the comm...
114
click to vote
COMPLEX
2009
Springer
15 years 4 months ago
2009
Springer
Creating ensembles of random but "realistic" topologies for complex systems is crucial for many tasks such as benchmark generation and algorithm analysis. In general, exp...
ASPDAC
2004
ACM
15 years 4 months ago
2004
ACM
- Minimum area is one of the important objectives in technology mapping for lookup table-based FPGAs. It has been proven that the problem is NP-complete. This paper presents a poly...
138
click to vote
ATS
2004
IEEE
15 years 4 months ago
2004
IEEE
Test data volume and scan power are two major concerns in SoC test. In this paper we present an alternative run-length coding method through scan chain reconfiguration to reduce b...