When a compiler translates a procedure, it must lay out the procedure’s stack frame in a way that respects the calling convention. Many compilers respect the convention either by...
Abstract. This article deals with global constraints for which the set of solutions can be recognized by an extended finite automaton whose size is bounded by a polynomial in n, w...
Abstract. Although algorithms for Distributed Constraint Optimization Problems (DCOPs) have emerged as a key technique for distributed reasoning, their application faces significa...
A constraint satisfaction problem (CSP) model can be preprocessed to ensure that any choices made will lead to solutions, without the need to backtrack. This can be especially usef...
J. Christopher Beck, Tom Carchrae, Eugene C. Freud...
In this paper we study four algorithms for computing the frequency of a given partial order. Here the frequency of a partial order is the number of standard labellings respecting t...