BEGIN:VCALENDAR
VERSION:2.0
PRODID:www.dresden-science-calendar.de
METHOD:PUBLISH
CALSCALE:GREGORIAN
X-MICROSOFT-CALSCALE:GREGORIAN
X-WR-TIMEZONE:Europe/Berlin
BEGIN:VTIMEZONE
TZID:Europe/Berlin
X-LIC-LOCATION:Europe/Berlin
BEGIN:DAYLIGHT
TZNAME:CEST
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
DTSTART:19810329T030000
RRULE:FREQ=YEARLY;INTERVAL=1;BYMONTH=3;BYDAY=-1SU
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:CET
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
DTSTART:19961027T030000
RRULE:FREQ=YEARLY;INTERVAL=1;BYMONTH=10;BYDAY=-1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:DSC-9851
DTSTART;TZID=Europe/Berlin:20150909T143000
SEQUENCE:1441784447
TRANSP:OPAQUE
DTEND;TZID=Europe/Berlin:20150909T151500
URL:https://www.dresden-science-calendar.de/calendar/en/detail/9851
LOCATION:MPI-PKS\, Nöthnitzer Straße 3801187 Dresden
SUMMARY:Lihoreau: Bees and the traveling salesman problem
CLASS:PUBLIC
DESCRIPTION:Speaker: Mathieu Lihoreau\nInstitute of Speaker: CNRS-Universit
 y Paul Sabatier\, Toulouse\, France\nTopics:\nPhysik\n Location:\n  Name: 
 MPI-PKS (Seminarroom 4)\n  Street: Nöthnitzer Straße 38\n  City: 01187 D
 resden\n  Phone: + 49 (0)351 871 0\n  Fax: \nDescription: Pollinators\, su
 ch as bees\, exploit patchily distributed food resources that replenish ov
 er time. Finding an efficient route to visit multiple flowers and return t
 o the nest is a complex optimisation task analogous to the well-known Trav
 eling Salesman Problem in graph theory. Here I will present experiments on
  bumblebees foraging in meadows of computer-controlled flowers equipped wi
 th automated tracking systems to discuss how foragers locate flowers and o
 ften develop near-optimal circuits to link them as they gain experience. C
 omparative analyses of our behavioural data across experimental conditions
  reveal simple search patterns and learning heuristics that bees\, and vir
 tually all nectar foraging animals\, may use to efficiently exploit their 
 complex foraging environments with brains of limited computational power.
DTSTAMP:20260618T203042Z
CREATED:20150905T074910Z
LAST-MODIFIED:20150909T074047Z
END:VEVENT
END:VCALENDAR