Sciweavers

714 search results - page 30 / 143
» Lexicographically-ordered constraint satisfaction problems
Sort
View
CSR
2009
Springer
14 years 10 months ago
Approximability of the Maximum Solution Problem for Certain Families of Algebras
We study the approximability of the maximum solution problem. This problem is an optimisation variant of the constraint satisfaction problem and it captures a wide range of interes...
Peter Jonsson, Johan Thapper
94
Voted
ER
2006
Springer
137views Database» more  ER 2006»
15 years 1 months ago
Preference Functional Dependencies for Managing Choices
Abstract. The notion of user preference in database modeling has recently received much attention in advanced applications, such as personalization of e-services, since it captures...
Wilfred Ng
AMAI
1999
Springer
14 years 9 months ago
Maintenance scheduling problems as benchmarks for constraint algorithms
The paper focuses on evaluating constraint satisfaction search algorithms on application based random problem instances. The application we use is a well-studied problem in the el...
Daniel Frost, Rina Dechter
DAGSTUHL
2008
14 years 11 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
CONSTRAINTS
2010
193views more  CONSTRAINTS 2010»
14 years 7 months ago
Constraint propagation on quadratic constraints
This paper considers constraint propagation methods for continuous constraint satisfaction problems consisting of linear and quadratic constraints. All methods can be applied after...
Ferenc Domes, Arnold Neumaier