Sciweavers

34 search results - page 5 / 7
» Inventory routing with continuous moves
Sort
View
CORR
2010
Springer
122views Education» more  CORR 2010»
13 years 7 months ago
How to meet asynchronously (almost) everywhere
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...
Jurek Czyzowicz, Arnaud Labourel, Andrzej Pelc
WSC
1997
13 years 8 months ago
Selective Rerouting Using Simulated Steady State System Data
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...
COMPGEOM
2008
ACM
13 years 9 months ago
Maximum thick paths in static and dynamic environments
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...
JNW
2008
177views more  JNW 2008»
13 years 7 months ago
Design and Evaluation of a Novel HIP-Based Network Mobility Protocol
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...
Szabolcs Nováczki, László Bok...
SIGCOMM
1991
ACM
13 years 11 months ago
IP-Based Protocols for Mobile Internetworking
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.