Sciweavers

980 search results - page 8 / 196
» Decentralized Constraint Satisfaction
Sort
View
DAGSTUHL
2008
13 years 9 months ago
Recent Results on the Algebraic Approach to the CSP
Abstract. We describe an algebraic approach to the constraint satisfaction problem (CSP) and present recent results on the CSP that make use of, in an essential way, this algebraic...
Andrei A. Bulatov, Matthew Valeriote
IJCAI
1993
13 years 9 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...
IADIS
2003
13 years 9 months ago
Adaptive Hypermedia Systems Featuring Information Customization Using Constraint Satisfaction Methods
We present an Information Customization framework, which offers a unique hybrid of Adaptive Hypermedia and Constraint Satisfaction methods. IC is being modelled as a constraint sa...
Chong Yan Han, Syed Sibte Raza Abidi, Yu-N Cheah
SIAMDM
2008
90views more  SIAMDM 2008»
13 years 7 months ago
Maximizing Supermodular Functions on Product Lattices, with Application to Maximum Constraint Satisfaction
Recently, a strong link has been discovered between supermodularity on lattices and tractability of optimization problems known as maximum constraint satisfaction problems. The pre...
Andrei A. Krokhin, Benoit Larose
LICS
2009
IEEE
14 years 2 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