5 search results - page 1 / 1 » Tractable Symmetry Breaking Using Restricted Search Trees |
ECAI
2004
Springer
13 years 10 months ago
2004
Springer
We present a new conceptual abstraction in symmetry breaking – the GE-tree. The construction and traversal of a GE-tree breaks all symmetries in any constraint satisfaction or si...
IJCAI
2003
13 years 6 months ago
2003
Symmetry breaking in CSPs has attracted consid erable attention in recent years. Various general schemes have been proposed to eliminate sym metries during search. In general,...
CONSTRAINTS
2006
13 years 4 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...
CP
2006
Springer
13 years 8 months ago
2006
Springer
ion of a given partial assignment of values to variables. Compared with other symmetry breaking techniques, the big advantage of dynamic symmetry breaking is that it can accommodat...
HEURISTICS
2008
13 years 3 months ago
2008
Since their beginning in constraint programming, set solvers have been applied to a wide range of combinatorial search problems, such as bin-packing, set partitioning, circuit desi...