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...
Effective operational control of a manufacturing system that has routing flexibility is dependent upon being able to make informed real-time decisions in the event of a system dis...
Catherine M. Harmonosky, Robert H. Farr, Ming-Chua...
We consider the problem of finding a maximum number of disjoint paths for unit disks moving amidst static or dynamic obstacles. For the static case we give efficient exact algorit...
Esther M. Arkin, Joseph S. B. Mitchell, Valentin P...
The rapid growth of IP-based mobile telecommunication technologies in the past few years has revealed situations where not only a single node but an entire network moves and change...
We consider the problem of providing network access to hosts whose physical location changes with time. Such hosts cannot depend on traditional forms of network connectivity and r...
John Ioannidis, Dan Duchamp, Gerald Q. Maguire Jr.