Sciweavers

711 search results - page 1 / 143
» Amalgams of Constraint Satisfaction Problems
Sort
View
IJCAI
2003
13 years 5 months ago
Amalgams of Constraint Satisfaction Problems
Many of standard practical techniques of solving constraint satisfaction problems use various decomposition methods to represent a problem as a combination of smaller ones. We stu...
Andrei A. Bulatov, Evgeny S. Skvortsov
EUSFLAT
2009
145views Fuzzy Logic» more  EUSFLAT 2009»
13 years 2 months ago
Valued Constraint Satisfaction Problems Applied to Functional Harmony
Harmonization with four voices is a musical problem which is subject to hard constraints, which absolutely need to be fulfilled, as well as to soft constraints, which preferably ho...
Nele Verbiest, Chris Cornelis, Yvan Saeys
CONSTRAINTS
2010
75views more  CONSTRAINTS 2010»
13 years 1 months ago
Redundant modeling in permutation weighted constraint satisfaction problems
Yat Chiu Law, Jimmy Ho-Man Lee, May H. C. Woo
ICPPW
2009
IEEE
13 years 1 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
CORR
2010
Springer
154views Education» more  CORR 2010»
13 years 28 days ago
Complexity of Homogeneous Co-Boolean Constraint Satisfaction Problems
Constraint Satisfaction Problems (CSP) constitute a convenient way to capture many combinatorial problems. The general CSP is known to be NP-complete, but its complexity depends on...
Florian Richoux