544 search results - page 55 / 109 » On the Complexity of Loop Fusion |
AIPS
2006
13 years 10 months ago
2006
Classical planning algorithms require that their operators be simple in order for planning to be tractable. However, the complexities of real world domains suggest that, in order ...
CGO
2009
IEEE
14 years 3 months ago
2009
IEEE
Compilers employ many aggressive code transformations to achieve highly optimized code. However, because of complex target architectures and unpredictable optimization interaction...
ICS
2007
Tsinghua U.
14 years 3 months ago
2007
Tsinghua U.
Sensitivity Analysis (SA) is a novel compiler technique that complements, and integrates with, static automatic parallelization analysis for the cases when relevant program behavi...
DATE
1998
IEEE
14 years 1 months ago
1998
IEEE
Near-future linac projects put yet unreached requirements on the LLRF control hardware in both performance and manageability. Meeting their field stability targets requires a clea...
ICSE
2010
IEEE-ACM
13 years 10 months ago
2010
IEEE-ACM
Many computations exhibit a trade off between execution time and quality of service. A video encoder, for example, can often encode frames more quickly if it is given the freedom ...