CPAIOR
2006
Springer
14 years 4 months ago
2006
Springer
CPAIOR
2006
Springer
14 years 4 months ago
2006
Springer
Abstract. We recently proposed a simple declarative language for specifying a wide range of counting and occurrence constraints. The language uses just two global primitives: the R...
CPAIOR
2006
Springer
14 years 4 months ago
2006
Springer
Abstract. In this paper we introduce a complex allocation and scheduling problem for variable voltage Multi-Processor System-on-Chip (MPSoC) platforms. We propose a methodology to ...
CPAIOR
2006
Springer
14 years 4 months ago
2006
Springer
Abstract. We propose two algorithms achieving generalized arc consistency for the soft global cardinality constraint with variable-based violation and with value-based violation. T...
CPAIOR
2006
Springer
14 years 4 months ago
2006
Springer
Abstract. We present a theoretical study on the idea of using mathematical programming relaxations for filtering binary constraint satisfaction problems. We introduce the consisten...
CPAIOR
2006
Springer
14 years 4 months ago
2006
Springer
Temporal planning (TP) is notoriously difficult because it requires to solve a propositional STRIPS planning problem with temporal constraints. In this paper, we propose an efficie...
CPAIOR
2006
Springer
14 years 4 months ago
2006
Springer
The lexicographically-ordered CSP ("lexicographic CSP" for short) combines a simple representation of preferences with the feasibility constraints of ordinary CSPs. Prefe...
CPAIOR
2004
Springer
14 years 4 months ago
2004
Springer
Abstract. Over the past years, a number of increasingly expressive languages for modelling constraint and optimisation problems have evolved. In developing a strategy to ease the c...
CPAIOR
2004
Springer
14 years 4 months ago
2004
Springer
The graph isomorphism problem consists in deciding if two given graphs have an identical structure. This problem can be modeled as a constraint satisfaction problem in a very strai...
CPAIOR
2009
Springer
14 years 5 months ago
2009
Springer
