BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Stochastic enumeration method for rare events\, counting and combi
 natorial optimization - Rubinstein\, R (Israel Institute of Technology)
DTSTART:20100621T101500Z
DTEND:20100621T104000Z
UID:TALK25313@talks.cam.ac.uk
CONTACT:Mustapha Amrani
DESCRIPTION:We present a new method for rare-event probability estimation\
 , combinatorial optimization and counting\, called the stochastic enumerat
 ion (SE) method. In terms of counting\, SE presents a stochastic replica o
 f the naive full enumeration method. It is well known that the latter is t
 ypically meaningless since the associated counting sets\, such as the sets
  of feasible solutions of the integer programming constraints\, are huge. 
 The SE method overcomes this difficulty by using a manageable sample size.
  We show how to implement the SE method for some well known difficult coun
 ting problems\, such as self-avoiding walks\, 0-1 tables and satisfiabilit
 y problems\, discuss its convergence\, and present numerical studies demon
 strating its superiority to the classic splitting method.
LOCATION:Seminar Room 1\, Newton Institute
END:VEVENT
END:VCALENDAR