170 search results - page 14 / 34 » A Model for Context-Specific Route Directions |
INFOCOM
2005
IEEE
15 years 5 months ago
2005
IEEE
Abstract— An ad hoc wireless network is an autonomous selforganizing system of mobile nodes connected by wireless links where nodes not in direct range communicate via intermedia...
117
click to vote
CORR
2008
Springer
14 years 11 months ago
2008
Springer
A decentralized search algorithm is a method of routing on a random graph that uses only limited, local, information about the realization of the graph. In some random graph model...
IPPS
1997
IEEE
15 years 3 months ago
1997
IEEE
Star networks were proposedrecently as an attractive alternative to the well-known hypercube models for interconnection networks. Extensive research has been performed that shows ...
CCCG
2008
15 years 1 months ago
2008
Local route discovery in geometric, strongly connected, undirected plane graphs is guaranteed by the Face Routing algorithm. The algorithm is local and geometric in the sense that...
100
click to vote
SODA
1998
ACM
15 years 1 months ago
1998
ACM
We present the first polylog-competitive online algorithm for the general multicast admission control and routing problem in the throughput model. The ratio of the number of reque...