Sciweavers

CP
2004
Springer
13 years 10 months ago
Computing the Frequency of Partial Orders
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...
Marc R. C. van Dongen
CP
2004
Springer
13 years 10 months ago
Decomposition and Learning for a Hard Real Time Task Allocation Problem
Abstract. We present a cooperation technique using an accurate management of nogoods to solve a hard real-time problem which consists in assigning periodic tasks to processors in t...
Hadrien Cambazard, Pierre-Emmanuel Hladik, Anne-Ma...
CP
2004
Springer
13 years 10 months ago
The Impact of AND/OR Search Spaces on Constraint Satisfaction and Counting
The contribution of this paper is in demonstrating the impact of AND/OR search spaces view on solutions counting. In contrast to the traditional (OR) search space view, the AND/OR ...
Rina Dechter, Robert Mateescu
CP
2004
Springer
13 years 10 months ago
Variable Ordering Heuristics Show Promise
J. Christopher Beck, Patrick Prosser, Richard J. W...
CP
2004
Springer
13 years 10 months ago
Backtrack-Free Search for Real-Time Constraint Satisfaction
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...
CP
2004
Springer
13 years 10 months ago
The Tractability of Global Constraints
Abstract. Constraint propagation is one of the techniques central to the success of constraint programming. Fast algorithms are used to prune the search space either before or duri...
Christian Bessière, Emmanuel Hebrard, Brahi...
CP
2004
Springer
13 years 10 months ago
Disjoint, Partition and Intersection Constraints for Set and Multiset Variables
We have started a systematic study of global constraints on set and multiset variables. We consider here disjoint, partition, and intersection constraints in conjunction with cardi...
Christian Bessière, Emmanuel Hebrard, Brahi...
CP
2004
Springer
13 years 10 months ago
Constraint Propagation as a Proof System
Abstract. Refutation proofs can be viewed as a special case of constraint propagation, which is a fundamental technique in solving constraint-satisfaction problems. The generalizat...
Albert Atserias, Phokion G. Kolaitis, Moshe Y. Var...
CP
2004
Springer
13 years 10 months ago
Leveraging the Learning Power of Examples in Automated Constraint Acquisition
Constraint programming is rapidly becoming the technology of choice for modeling and solving complex combinatorial problems. However, users of constraint programming technology nee...
Christian Bessière, Remi Coletta, Eugene C....
CP
2004
Springer
13 years 10 months ago
Preprocessing Techniques for Distributed Constraint Optimization
Abstract. Although algorithms for Distributed Constraint Optimization Problems (DCOPs) have emerged as a key technique for distributed reasoning, their application faces significa...
Syed Muhammad Ali, Sven Koenig, Milind Tambe