Sciweavers

566 search results - page 8 / 114
» Solution Reuse in Dynamic Constraint Satisfaction Problems
Sort
View
ICPPW
2009
IEEE
14 years 10 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
IJCAI
1993
15 years 1 months ago
Diagnosing and Solving Over-Determined Constraint Satisfaction Problems
Constraint relaxation is a frequently used technique for managing over-determined constraint satisfaction problems. A problem in constraint relaxation is the selection of the appr...
R. R. Bakker, F. Dikker, F. Tempelman, P. M. Wognu...
JUCS
2007
118views more  JUCS 2007»
15 years 9 hour ago
Satisfying Assignments of Random Boolean Constraint Satisfaction Problems: Clusters and Overlaps
: The distribution of overlaps of solutions of a random constraint satisfaction problem (CSP) is an indicator of the overall geometry of its solution space. For random k-SAT, nonri...
Gabriel Istrate
AAAI
2006
15 years 1 months ago
Constraint Symmetry and Solution Symmetry
Symmetry in constraint satisfaction problems (CSPs) has been considered in two fundamentally different ways: as an operation preserving the solutions of a CSP instance, or as an o...
David A. Cohen, Peter Jeavons, Christopher Jeffers...
AAAI
2004
15 years 1 months ago
Domain Transmutation in Constraint Satisfaction Problems
We study local interchangeability of values in constraint networks based on a new approach where a single value in the domain of a variable can be treated as a combination of &quo...
James Bowen, Chavalit Likitvivatanavong