Sciweavers

2283 search results - page 328 / 457
» Bounds of Graph Characteristics
Sort
View
ICC
2009
IEEE
148views Communications» more  ICC 2009»
14 years 2 months ago
Analysis of Probabilistic Flooding: How Do We Choose the Right Coin?
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...
Sérgio Crisóstomo, Udo Schilcher, Ch...
INFOCOM
2009
IEEE
14 years 2 months ago
Spatial Distribution in Routing Table Design for Sensor Networks
—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 ...
Rik Sarkar, Xianjin Zhu, Jie Gao
AINA
2007
IEEE
14 years 2 months ago
Depth-Latency Tradeoffs in Multicast Tree Algorithms
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...
Michael T. Helmick, Fred S. Annexstein
SECON
2007
IEEE
14 years 2 months ago
Minimum Interference Channel Assignment in Multi-Radio Wireless Mesh Networks
—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...
Anand Prabhu Subramanian, Himanshu Gupta, Samir R....
CPAIOR
2007
Springer
14 years 2 months ago
Best-First AND/OR Search for 0/1 Integer Programming
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...
Radu Marinescu 0002, Rina Dechter