Sciweavers

2421 search results - page 77 / 485
» Approximate Flow-Aware Networking
Sort
View
OPODIS
2007
14 years 11 months ago
Peer to Peer Multidimensional Overlays: Approximating Complex Structures
Peer to peer overlay networks have proven to be a good support for storing and retrieving data in a fully decentralized way. A sound approach is to structure them in such a way tha...
Olivier Beaumont, Anne-Marie Kermarrec, Etienne Ri...
CDC
2009
IEEE
168views Control Systems» more  CDC 2009»
15 years 2 months ago
Content distribution by multiple multicast trees and intersession cooperation: Optimal algorithms and approximations
—The paper addresses the problem of massive content distribution in the network where multiple sessions coexist. In the traditional approaches, the sessions form separate overlay...
Xiaoying Zheng, Chunglae Cho, Ye Xia
ADHOCNOW
2008
Springer
15 years 4 months ago
Approximating Minimum-Power k-Connectivity
Abstract. The Minimum-Power k-Connected Subgraph (MPkCS) problem seeks a power (range) assignment to the nodes of a given wireless network such that the resulting communication (su...
Zeev Nutov
GECCO
2007
Springer
162views Optimization» more  GECCO 2007»
15 years 4 months ago
Using pair approximations to predict takeover dynamics in spatially structured populations
The topological properties of a network directly impact the flow of information through a system. For example, in natural populations, the network of inter-individual contacts aff...
Joshua L. Payne, Margaret J. Eppstein
AAAI
2006
14 years 11 months ago
An Edge Deletion Semantics for Belief Propagation and its Practical Impact on Approximation Quality
We show in this paper that the influential algorithm of iterative belief propagation can be understood in terms of exact inference on a polytree, which results from deleting enoug...
Arthur Choi, Adnan Darwiche