2421 search results - page 302 / 485 » Approximate Flow-Aware Networking |
114
Voted
SODA
2010
ACM
15 years 12 months ago
2010
ACM
The group Steiner problem is a classical network design problem where we are given a graph and a collection of groups of vertices, and want to build a min-cost subgraph that conne...
127
Voted
ICASSP
2009
IEEE
15 years 9 months ago
2009
IEEE
Resource limitations in wireless sensor networks have put stringent constraints on distributed signal processing. In this paper, we propose a cluster-based decentralized variation...
134
click to vote
INFOCOM
2009
IEEE
15 years 9 months ago
2009
IEEE
—The emerging wireless relay networks (WRNs) are expected to provide significant improvement on throughput and extension of coverage area for next-generation wireless systems. W...
118
Voted
MFCS
2009
Springer
15 years 9 months ago
2009
Springer
The core of a cooperative game contains all stable distributions of a coalition’s gains among its members. However, some games have an empty core, with every distribution being ...
93
Voted
GLOBECOM
2008
IEEE
15 years 9 months ago
2008
IEEE
—The problem of maximizing the sum of the transmit rates while limiting the outage probability below an appropriate threshold is investigated for networks where the nodes have li...