2283 search results - page 328 / 457 » Bounds of Graph Characteristics |
111
Voted
ICC
2009
IEEE
15 years 10 months ago
2009
IEEE
Abstract—This paper studies probabilistic information dissemination in random networks. Consider the following scenario: A node intends to deliver a message to all other nodes in...
122
Voted
INFOCOM
2009
IEEE
15 years 10 months ago
2009
IEEE
—We propose a generic routing table design principle for scalable routing on networks with bounded geometric growth. Given an inaccurate distance oracle that estimates the graph ...
141
Voted
AINA
2007
IEEE
15 years 9 months ago
2007
IEEE
The construction of multicast trees is complicated by the need to balance a number of important objectives, including: minimizing latencies, minimizing depth/hops, and bounding th...
150
Voted
SECON
2007
IEEE
15 years 9 months ago
2007
IEEE
—In this paper, we consider multi-hop wireless mesh networks, where each router node is equipped with multiple radio interfaces and multiple channels are available for communicat...
113
click to vote
CPAIOR
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. AND/OR search spaces are a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is its sensitivity to the struc...