12 search results - page 3 / 3 » Finding the Shortest Watchman Route in a Simple Polygon |
CORR
2002
Springer
13 years 7 months ago
2002
Springer
We study routing and scheduling in packet-switched networks. We assume an adversary that controls the injection time, source, and destination for each packet injected. A set of pat...
ACRI
2006
Springer
14 years 1 months ago
2006
Springer
This paper propose a maze routing algorithm based on cellular automata. The aim of this algorithm is find the shortest path between the source cell and the target cell , so that th...