Mittagsseminar Talk Information

Date and Time: Thursday, August 26, 2010, 12:15 pm

Duration: This information is not available in the database

Location: CAB G51

Speaker: Stefan Schneider

Random Walk Algorithms for SAT and Constraint Satisfaction Problems

Schöning discovered a simple local-search randomized algorithm for solving (d,k)-CSP, which still remains one of the fastest algorithms known so far. We discuss a modification to the algorithm where we arrange the d possible values of each variable on a search graph. This modification is due to Scheder, who improved the derandomization of Schöning's algorithm using search graphs. In this talk we will however show that for the randomized version any search graph that satisfies the symmetry property of distance-regularity gives us the same running time as the original algorithm by Schöning.

Thesis supervised by E. Welzl and R. Moser.

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.3392   |   admin login