140 search results - page 9 / 28 » Rewriting Numeric Constraint Satisfaction Problems for Consi... |
CP
2003
Springer
14 years 23 days ago
2003
Springer
A binary constraints network consists of a set of n variables, defined on domains of size at most d, and a set of e binary constraints. The binary constraint satisfaction problem ...
CONSTRAINTS
2006
13 years 7 months ago
2006
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...
SAC
2005
ACM
14 years 1 months ago
2005
ACM
As opposed to finite domain CSPs, arc consistency cannot be enforced, in general, on CSPs over the reals, including very simple instances. In contrast, a stronger property, the s...
CONSTRAINTS
2008
13 years 7 months ago
2008
Submodular function minimization is a polynomially-solvable combinatorial problem. Unfortunately the best known general-purpose algorithms have high-order polynomial time complexi...
FLAIRS
2004
13 years 9 months ago
2004
Constraint satisfaction technology emerged from AI research. Its practical success is based on integration of sophisticated search with consistency techniques reducing the search ...