595 search results - page 1 / 119 » Using Constraints with Memory to Implement Variable Eliminat... |
ECAI
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. Adaptive consistency is a solving algorithm for constraint networks. Its basic step is variable elimination: it takes a network as input, and producesan equivalent networ...
ICLP
1995
Springer
13 years 9 months ago
1995
Springer
Incorporating the possibility of attaching attributes to variables in a logic programming system has been shown to allow the addition of general constraint solving capabilities to...
POPL
1999
ACM
13 years 9 months ago
1999
ACM
Superfluous variables are often produced as the byproducts of program transformations, compilation, and poorly written code. These variables are irrelevant to the computational o...
IEEEPACT
2009
IEEE
14 years 3 days ago
2009
IEEE
Abstract—Load elimination is a classical compiler transformation that is increasing in importance for multi-core and many-core architectures. The effect of the transformation is ...
LCTRTS
2009
Springer
14 years 7 days ago
2009
Springer
Most programming languages support a call stack in the programming model and also in the runtime system. We show that for applications targeting low-power embedded microcontroller...