Sciweavers

405 search results - page 1 / 81
» On the Complexity of Global Constraint Satisfaction
Sort
View
LICS
2009
IEEE
13 years 11 months ago
The Complexity of Global Cardinality Constraints
In a constraint satisfaction problem (CSP) the goal is to find an assignment of a given set of variables subject to specified constraints. A global cardinality constraint is an ...
Andrei A. Bulatov, Dániel Marx
ISAAC
2005
Springer
109views Algorithms» more  ISAAC 2005»
13 years 10 months ago
On the Complexity of Global Constraint Satisfaction
Cristina Bazgan, Marek Karpinski
ICPPW
2009
IEEE
13 years 2 months ago
Global Multiprocessor Real-Time Scheduling as a Constraint Satisfaction Problem
In this paper we address the problem of global real-time periodic scheduling on heterogeneous multiprocessor platforms. We give a solution based on a constraint satisfaction proble...
Liliana Cucu-Grosjean, Olivier Buffet
CP
2003
Springer
13 years 10 months ago
A Synthesis of Constraint Satisfaction and Constraint Solving
Abstract. This paper offers a critique of the framework of Constraint Satisfaction Problems. While this framework has been successful in studying search techniques, and has inspire...
Michael J. Maher
ECAI
2004
Springer
13 years 10 months ago
Improving Asynchronous Backtracking for Dealing with Complex Local Problems
Distributed constraint satisfaction, in its most general acceptation, involves a collection of agents solving local constraint satisfaction subproblems, and a communication protoco...
Arnold Maestre, Christian Bessière