743 search results - page 38 / 149 » Optimal Abstraction on Real-Valued Programs |
ESEC
1999
Springer
15 years 2 months ago
1999
Springer
Abstract. We present a novel approach to avoid the debugging of optimized code through comparison checking. In the technique presented, both the unoptimized and optimized versions ...
ICCS
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. For many applications, cache misses are the primary performance bottleneck. Even though much research has been performed on automatically optimizing cache behavior at the...
ISLPED
2003
ACM
15 years 3 months ago
2003
ACM
The power consumption of a sequential circuit can be reduced by decomposing it into subcircuits which can be turned off when inactive. Power can also be reduced by careful state e...
CPM
2000
Springer
15 years 2 months ago
2000
Springer
Abstract. Ambiguity in dynamic programming arises from two independent sources, the non-uniqueness of optimal solutions and the particular recursion scheme by which the search spac...
COCOA
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. In this paper, we study an efficient approximate integer linear programming formulation of the general problem of one-dimensional periodic task scheduling under storage r...