2 search results - page 1 / 1 » How to meet asynchronously (almost) everywhere |
CORR
2010
Springer
13 years 11 months ago
2010
Springer
Two mobile agents (robots) with distinct labels have to meet in an arbitrary, possibly infinite, unknown connected graph or in an unknown connected terrain in the plane. Agents ar...
FOCM
2010
13 years 9 months ago
2010
Free-discontinuity problems describe situations where the solution of interest is defined by a function and a lower dimensional set consisting of the discontinuities of the funct...