6167 search results - page 926 / 1234 » Can Refinement be Automated |
142
Voted
DAC
2001
ACM
16 years 5 months ago
2001
ACM
In this paper, we present a new technique for the e cient dynamic detection and removal of inactive clauses, i.e. clauses that do not a ect the solutions of interest of a Boolean ...
151
Voted
DAC
2001
ACM
16 years 5 months ago
2001
ACM
The quality of synthesis results for most high level synthesis approaches is strongly a ected by the choice of control ow through conditions and loops in the input description. In...
134
click to vote
DAC
2001
ACM
16 years 5 months ago
2001
ACM
An approach for factoring general boolean functions was described in [15, 16] which is based on graph partitioning algorithms. In this paper, we present a very fast algorithm for ...
133
click to vote
DAC
2001
ACM
16 years 5 months ago
2001
ACM
This paper addresses battery-aware static scheduling in batterypowered distributed real-time embedded systems. As suggested by previous work, reducing the discharge current level ...
132
Voted
DAC
2001
ACM
16 years 5 months ago
2001
ACM
Power-aware systems are those that must make the best use of available power. They subsume traditional low-power systems in that they must not only minimize power when the budget ...