Speaker: Andrew See
 
Day:  Wednesday, 11/03/2004
Room: ITE 336
Time:  3:30pm-4:30pm 

Title: Symmetry Breaking in Constraint Programming
----------------------------------------------------------------------------

Abstract: 
Constraint Satisfaction problems often have symmetries, so that a 
solution can have many equivalent solutions.  Typically we only want one 
of these equivalent solutions, or one from each equivalency class. By 
breaking the symmetries in these problems we can improve performance by 
reducing redundant effort.
In this talk I'll give a survey of some techniques that have been used 
for symmetry breaking.

back to CSE-TS page