366 search results - page 34 / 74 » Sensitivity Analysis and Optimization Algorithm -- Based on ... |
115
click to vote
POPL
2010
ACM
15 years 11 months ago
2010
ACM
We present an analysis to automatically determine if a program represents a continuous function, or equivalently, if infinitesimal changes to its inputs can only cause infinitesim...
DAC
2004
ACM
15 years 7 months ago
2004
ACM
Grid-warping is a new placement algorithm based on a strikingly simple idea: rather than move the gates to optimize their location, we elastically deform a model of the 2-0 chip s...
146
click to vote
ICCL
1998
IEEE
15 years 6 months ago
1998
IEEE
An aggregate array computation is a loop that computes accumulated quantities over array elements. Such computations are common in programs that use arrays, and the array elements...
TOPLAS
2002
15 years 1 months ago
2002
A number of existing compiler techniques hinge on the analysis of array accesses in the program. The most important task in array access analysis is to collect the information abo...
117
Voted
LPNMR
1997
Springer
15 years 6 months ago
1997
Springer
We present a bottom-up algorithm for the computation of the well-founded model of non-disjunctive logic programs which is based on the set of elementary program transformations stu...