BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//wp-events-plugin.com//7.2.3.1//EN
BEGIN:VEVENT
UID:438@lincs.fr
DTSTART;TZID=Europe/Paris:20190220T140000
DTEND;TZID=Europe/Paris:20190220T150000
DTSTAMP:20191129T134040Z
URL:https://www.lincs.fr/events/optimally-gathering-two-robots/
SUMMARY:Optimally Gathering Two Robots
DESCRIPTION:\nWe present a self-stabilizing algorithm that ensures in
 finite time the gathering of two robots in the non-rigid ASYNC model. To
 circumvent established impossibility results\, we assume robots are
 equipped with 2-colors lights and are able to measure distances between one
 another. Aside from its light\, a robot has no memory of its past actions\,
 and its protocol is deterministic. Since\, in the same model\, gathering is
 impossible when lights have a single color\, our solution is optimal with
 respect to the number of used colors.\n
CATEGORIES:Seminars,Youtube
LOCATION:LINCS / EIT Digital\, 23 avenue d'Italie\, 75013 Paris\, France
X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013
 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS / EIT Digital:geo:0,0
END:VEVENT
BEGIN:VTIMEZONE
TZID:Europe/Paris
X-LIC-LOCATION:Europe/Paris
BEGIN:STANDARD
DTSTART:20181028T020000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
END:STANDARD
END:VTIMEZONE
END:VCALENDAR