6568 search results - page 350 / 1314 » Reducing the Complexity of Reductions |
209
Voted
ASP
2001
Springer
16 years 2 days ago
2001
Springer
We define a reduction system Ë¿ which preserves the stable semantics. This system includes two types of transformation rules. One type (which we call ˾) preserves the stable...
206
click to vote
SAS
1997
Springer
15 years 11 months ago
1997
Springer
We present a type-based flow analysis for simply typed lambda calculus with booleans, data-structures and recursion. The analysis is exact in the following sense: if the analysis ...
187
click to vote
DSD
2004
IEEE
15 years 11 months ago
2004
IEEE
Loop fusion and loop shifting are well recognized loop transformations for memory requirement reduction. Stateof-the-art optimizations with loop fusion and shifting are based on h...
214
click to vote
ECAI
2008
Springer
15 years 9 months ago
2008
Springer
In some application domains, such as medical imaging, the objects that compose the scene are known as well as some of their properties and their spatial arrangement. We can take ad...
221
click to vote
WSC
1998
15 years 9 months ago
1998
When pricing options via Monte Carlo simulations, precision can be improved either by performing longer simulations, or by reducing the variance of the estimators. In this paper, ...