Results 1  10
of
10,055
Symmetry Breaking
, 2001
"... Symmetries in constraint satisfaction or combinatorial optimization problems can cause considerable difficulties for exact solvers. One way to overcome ..."
Abstract

Cited by 93 (5 self)
 Add to MetaCart
Symmetries in constraint satisfaction or combinatorial optimization problems can cause considerable difficulties for exact solvers. One way to overcome
Symmetry Breaking
, 810
"... Symmetry BreakingThe front cover shows quantum mechanics (symbolized by Schrödinger’s cat) playing withthe Higgsfield in the Mexican hat potential. The back cover shows the Maxwell construction of the Mexican hat potential, which is obtained in the pathintegral approach to the N = 2 linear sigma m ..."
Abstract
 Add to MetaCart
Symmetry BreakingThe front cover shows quantum mechanics (symbolized by Schrödinger’s cat) playing withthe Higgsfield in the Mexican hat potential. The back cover shows the Maxwell construction of the Mexican hat potential, which is obtained in the pathintegral approach to the N = 2 linear sigma
SYMMETRY BREAKING AND DEFECTS
, 2002
"... Symmetrybreaking phase transitions are ubiquitous in condensed matter ..."
Symmetry Breaking in
"... .We analize the different ways for the spontaneous breaking of the gauge symmetry, for the [SU (6)] 3\Omega Z 3 family unification model. In particular we study the consequences of a previous selection for the vacuum expectation values of the Higgs fields, showing that such set predicts unwanted f ..."
Abstract
 Add to MetaCart
.We analize the different ways for the spontaneous breaking of the gauge symmetry, for the [SU (6)] 3\Omega Z 3 family unification model. In particular we study the consequences of a previous selection for the vacuum expectation values of the Higgs fields, showing that such set predicts unwanted
SymmetryBreaking Predicates for Search Problems
, 1996
"... Many reasoning and optimization problems exhibit symmetries. Previous work has shown how special purpose algorithms can make use of these symmetries to simplify reasoning. We present a general scheme whereby symmetries are exploited by adding "symmetrybreaking" predicates to the the ..."
Abstract

Cited by 198 (1 self)
 Add to MetaCart
Many reasoning and optimization problems exhibit symmetries. Previous work has shown how special purpose algorithms can make use of these symmetries to simplify reasoning. We present a general scheme whereby symmetries are exploited by adding "symmetrybreaking" predicates
Symmetries of Symmetry Breaking Constraints
"... Symmetry is an important feature of many constraint programs. We show that any symmetry acting on a set of symmetry breaking constraints can be used to break symmetry. Different symmetries pick out different solutions in each symmetry class. We use these observations in two methods for eliminating s ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
Symmetry is an important feature of many constraint programs. We show that any symmetry acting on a set of symmetry breaking constraints can be used to break symmetry. Different symmetries pick out different solutions in each symmetry class. We use these observations in two methods for eliminating
Dynamic Symmetry Breaking Constraints
, 2008
"... We present a general method for dynamically posting symmetry breaking constraints during search. The basic idea is very simple. Given any set of symmetry breaking constraints, if during search a symmetry of one of these constraints is entailed and this is consistent with previously posted symmetry ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
We present a general method for dynamically posting symmetry breaking constraints during search. The basic idea is very simple. Given any set of symmetry breaking constraints, if during search a symmetry of one of these constraints is entailed and this is consistent with previously posted symmetry
Symmetry Breaking in Constraint Programming
 Proceedings of ECAI2000
, 2000
"... We describe a method for symmetry breaking during search (SBDS) in constraint programming. It has the great advantage of not interfering with heuristic choices. It guarantees to return a unique solution from each set of symmetrically equivalent ones, which is the one found first by the variable and ..."
Abstract

Cited by 89 (11 self)
 Add to MetaCart
We describe a method for symmetry breaking during search (SBDS) in constraint programming. It has the great advantage of not interfering with heuristic choices. It guarantees to return a unique solution from each set of symmetrically equivalent ones, which is the one found first by the variable
Results 1  10
of
10,055