Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Tuesday, April 17, 2018, 12:15 pm
Duration: 30 minutes
Location: CAB G51
Speaker: Oren Luidor (Technion)
We consider k ants walking on the d-dimensional cubic lattice in search for food. The motion of the ants is governed by a finite-state, possibly random, automaton and they can only communicate with each other when they are at the same site. For any d at least 1, what is the minimal k for which one can find an automaton that guarantees that at least one ant will find the food (no matter where it is placed) at time with finite mean? We answer this questions fully in d=1,2 and partially in d at least 3. Joint work with: L. Cohen, Y. Emek and J. Uitto.
Automatic MiSe System Software Version 1.4803M | admin login