BEGIN:VCALENDAR
VERSION:2.0
PRODID:Linklings LLC
BEGIN:VTIMEZONE
TZID:America/Chicago
X-LIC-LOCATION:America/Chicago
BEGIN:DAYLIGHT
TZOFFSETFROM:-0600
TZOFFSETTO:-0500
TZNAME:CDT
DTSTART:19700308T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0500
TZOFFSETTO:-0600
TZNAME:CST
DTSTART:19701101T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20260522T150110Z
LOCATION:C2/3/4 Ballroom
DTSTART;TZID=America/Chicago:20181114T083000
DTEND;TZID=America/Chicago:20181114T170000
UID:submissions.supercomputing.org_SC18_sess323_post173@linklings.com
SUMMARY:A Massively Parallel Evolutionary Markov Chain Monte Carlo Algorit
 hm for Sampling Complicated Multimodal State SpacesState
DESCRIPTION:Wendy K. Tam Cho and Yan Liu (University of Illinois)\n\nWe de
 velop an Evolutionary Markov Chain Monte Carlo (EMCMC) algorithm for sampl
 ing from large multi-modal state spaces. Our algorithm combines the advant
 ages of evolutionary algorithms (EAs) as optimization heuristics and the t
 heoretical convergence properties of Markov Chain Monte Carlo (MCMC) algor
 ithms for sampling from unknown distributions. We harness massive computat
 ional power with a parallel EA framework that guides a large set of Markov
  chains. Our algorithm has applications in many different fields of scienc
 e. We demonstrate its effectiveness with an application to political redis
 tricting.\n\nRegistration Category: Tech Program Reg Pass, Exhibits Reg Pa
 ss\n\n
END:VEVENT
END:VCALENDAR