410 search results - page 32 / 82 » Upgrading Shortest Paths in Networks |
114
click to vote
CORR
2008
Springer
15 years 1 months ago
2008
Springer
We study the worst-case communication complexity of distributed algorithms computing a path problem based on stationary distributions of random walks in a network G with the caveat...
134
click to vote
ICNSC
2007
IEEE
15 years 7 months ago
2007
IEEE
—This paper presents ceiling light landmarks based localization and motion control for a mobile robot. The novel mechanism design for the mobile robot is introduced, and the meth...
104
click to vote
IDA
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. We propose a generic framework and methods for simplification of large networks. The methods can be used to improve the understandability of a given network, to complemen...
110
click to vote
INFOCOM
2002
IEEE
15 years 6 months ago
2002
IEEE
—The majority of the existing ad hoc wireless network routing protocols has a tendency to use the shortest single path from the source to the destination. However, in constantly ...
OSN
2008
15 years 1 months ago
2008
User-controlled circuit-switched optical networks are gaining popularity in an effort to fulfill the insatiable data transport needs of the online community. In this paper we cons...