108 search results - page 14 / 22 » Constant-Work-Space Algorithm for a Shortest Path in a Simpl... |
ICRA
1999
IEEE
13 years 12 months ago
1999
IEEE
This paper presents a new globally convergent rangesensor based navigation algorithm in three-dimensions, called 3DBug. The 3DBug algorithm navigates a point robot in a three-dime...
NIPS
1993
13 years 9 months ago
1993
This paper describes the Q-routing algorithm for packet routing, in which a reinforcement learning module is embedded into each node of a switching network. Only local communicati...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
We provide linear-time algorithms for geometric graphs with sublinearly many crossings. That is, we provide algorithms running in O(n) time on connected geometric graphs having n ...
GSN
2009
Springer
13 years 11 months ago
2009
Springer
En-route data compression is fundamental to reduce the power consumed for data gathering in sensor networks. Typical in-network compression schemes involve the distributed computat...
SIGCOMM
1999
ACM
13 years 12 months ago
1999
ACM
The conventional approach to routing in computer networks consists of using a heuristic to compute a single shortest path from a source to a destination. Single-path routing is ve...