Sciweavers

419 search results - page 10 / 84
» An LP-Designed Algorithm for Constraint Satisfaction
Sort
View
CONSTRAINTS
2006
105views more  CONSTRAINTS 2006»
13 years 8 months ago
Symmetry Breaking Constraints for Value Symmetries in Constraint Satisfaction
Constraint satisfaction problems (CSPs) sometimes contain both variable symmetries and value symmetries, causing adverse effects on CSP solvers based on tree search. As a remedy, s...
Y. Law, J. Lee
IJCAI
2003
13 years 9 months ago
Propagate the Right Thing: How Preferences Can Speed-Up Constraint Solving
We present an algorithm Pref-AC that limits arc consistency (AC) to the preferred choices of a tree search procedure and that makes constraint solving more efficient without chan...
Christian Bessière, Anaïs Fabre, Ulric...
CPAIOR
2006
Springer
14 years 4 days ago
A Totally Unimodular Description of the Consistent Value Polytope for Binary Constraint Programming
Abstract. We present a theoretical study on the idea of using mathematical programming relaxations for filtering binary constraint satisfaction problems. We introduce the consisten...
Ionut D. Aron, Daniel H. Leventhal, Meinolf Sellma...
STOC
2005
ACM
111views Algorithms» more  STOC 2005»
14 years 8 months ago
Tensor decomposition and approximation schemes for constraint satisfaction problems
Wenceslas Fernandez de la Vega, Marek Karpinski, R...
AMAI
1999
Springer
13 years 8 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