CP
2003
Springer
14 years 5 months ago
2003
Springer
CP
2003
Springer
14 years 5 months ago
2003
Springer
Abstract. Most previous theoretical study of the complexity of the constraint satisfaction problem has considered a simplified version of the problem in which all variables have t...
CP
2003
Springer
14 years 5 months ago
2003
Springer
Abstract. In many situations, a set of hard constraints encodes the feasible configurations of some system or product over which users have preferences. We consider the problem of...
CP
2003
Springer
14 years 5 months ago
2003
Springer
We provide a reformulation of the constraint hierarchies (CHs) framework based on the notion of error indicators. Adapting the generalized view of local consistency in semiring-ba...
CP
2003
Springer
14 years 5 months ago
2003
Springer
A reason to distribute constraint satisfaction is privacy: agents may not want to share their values, and they may wish to keep constraints as private as possible. In this paper, w...
CP
2003
Springer
14 years 5 months ago
2003
Springer
CP
2003
Springer
14 years 5 months ago
2003
Springer
CC
2003
Springer
14 years 5 months ago
2003
Springer
Abstract. The register allocation in loops is generally performed after or during the software pipelining process. This is because doing a conventional register allocation at firs...
CC
2003
Springer
14 years 5 months ago
2003
Springer
CC
2003
Springer
14 years 5 months ago
2003
Springer
We have developed Tm, a template-based metacompiler. Given a set of data-structure definitions and a template, Tm generates files that instantiate the template for the given data...