BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Drupal iCal API//EN
X-WR-CALNAME:Events items teaser
X-WR-TIMEZONE:America/Toronto
BEGIN:VTIMEZONE
TZID:America/Toronto
X-LIC-LOCATION:America/Toronto
BEGIN:DAYLIGHT
TZNAME:EDT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
DTSTART:20220313T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20211107T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:68335089da631
DTSTART;TZID=America/Toronto:20220916T130000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20220916T130000
URL:/combinatorics-and-optimization/events/combinatoria
 l-optimization-reading-group-david-kalichman
SUMMARY:Combinatorial Optimization Reading Group - David Kalichman
CLASS:PUBLIC
DESCRIPTION:Summary \n\nTITLE: Stochastic Probing with Applications\n\nSpea
 ker:\n David Kalichman\n\nAffiliation:\n University of À¶Ý®ÊÓƵ\n\nLocatio
 n:\n MC 6029 or contact Rian Neogi for Zoom link\n\nABSTRACT:  We will ex
 plore a stochastic probing problem. Given a set\nof elements which have we
 ights and independent probabilities of being\n\"active\,\" the goal is to 
 construct a subset of active elements of\nmaximum weight. To form such a s
 et\, we must \"probe\" elements\nsequentially to determine whether they ar
 e active.\n 
DTSTAMP:20250525T171657Z
END:VEVENT
END:VCALENDAR