Sciweavers

151 search results - page 2 / 31
» Experimental Evaluation of Preprocessing Techniques in Const...
Sort
View
CSCLP
2004
Springer
13 years 11 months ago
New Structural Decomposition Techniques for Constraint Satisfaction Problems
We propose four new structural decomposition techniques for Constraint Satisfaction Problems. We compare these four techniques both theoretically and experimentally with hinge deco...
Yaling Zheng, Berthe Y. Choueiry
CONSTRAINTS
2010
193views more  CONSTRAINTS 2010»
13 years 3 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
AICOM
2004
92views more  AICOM 2004»
13 years 6 months ago
An efficient consistency algorithm for the Temporal Constraint Satisfaction Problem
Abstract. Dechter et al. [5] proposed solving the Temporal Constraint Satisfaction Problem (TCSP) by modeling it as a metaCSP, which is a finite CSP with a unique global constraint...
Berthe Y. Choueiry, Lin Xu
AISC
2004
Springer
13 years 11 months ago
Combination of Nonlinear Terms in Interval Constraint Satisfaction Techniques
Nonlinear constraint systems can be solved by combining consistency techniques and search. In this approach, the search space is reduced using local reasoning on constraints. Howev...
Laurent Granvilliers, Mina Ouabiba
AAAI
1996
13 years 7 months ago
Enhancements of Branch and Bound Methods for the Maximal Constraint Satisfaction Problem
Two methods are described for enhancing performance of branch and bound methods for overconstrained CSPS. These methods improve either the upper or lower bound, respectively, duri...
Richard J. Wallace