3 search results - page 1 / 1 » Traversing Directed Eulerian Mazes |
WG
2000
Springer
13 years 9 months ago
2000
Springer
DAC
1995
ACM
13 years 9 months ago
1995
ACM
We propose a novel optimization scheme that can improve the routing by reducing a newly observed router decaying effect. A pair of greedy-grow algorithms, each emphasizing a diffe...
STOC
1997
ACM
13 years 9 months ago
1997
ACM
We consider exploration problems where a robot has to construct a complete map of an unknown environment. We assume that the environment is modeled by a directed, strongly connecte...