980 search results - page 179 / 196 » Hierarchical routing over dynamic wireless networks |
JCP
2008
15 years 1 months ago
2008
To build a cooperative logistics network covering multiple enterprises, a planning method that can build a long-distance transportation network is required. Many strict constraints...
123
click to vote
JSA
2006
15 years 1 months ago
2006
Stringent memory access and search speed requirements are two of the main bottlenecks in wire speed processing. Most viable search engines are implemented in content addressable m...
112
click to vote
SPAA
2003
ACM
15 years 6 months ago
2003
ACM
We propose a new approach for constructing P2P networks based on a dynamic decomposition of a continuous space into cells corresponding to servers. We demonstrate the power of thi...
IFIPTCS
2010
14 years 11 months ago
2010
Most highly dynamic infrastructure-less networks have in common that the assumption of connectivity does not necessarily hold at a given instant. Still, communication routes can be...
119
click to vote
SDM
2007
SIAM
15 years 2 months ago
2007
SIAM
Given a large sparse graph, how can we find patterns and anomalies? Several important applications can be modeled as large sparse graphs, e.g., network traffic monitoring, resea...