194 search results - page 23 / 39 » Gathering Algorithms on Paths Under Interference Constraints |
135
click to vote
CDC
2009
IEEE
15 years 6 months ago
2009
IEEE
Abstract— Many problems associated with networked systems can be formulated as network utility maximization (NUM) problems. NUM problems maximize a global separable measure of ne...
108
Voted
CORR
2008
Springer
15 years 1 months ago
2008
Springer
In this paper, we consider single-source, single-sink (ss-ss) multi-hop relay networks, with slow-fading Rayleigh links and single-antenna relay nodes operating under the half-dupl...
110
Voted
WADS
1997
Springer
15 years 6 months ago
1997
Springer
In this paper we consider the problem of nding a core of limited length in a tree. A core is a path, which minimizes the sum of the distances to all nodes in the tree. This proble...
108
click to vote
PIMRC
2010
IEEE
14 years 11 months ago
2010
IEEE
We consider the problem of multi-cell downlink beamforming with N cells and K terminals per cell. Cooperation among base stations (BSs) has been found to increase the system throug...
109
Voted
ICASSP
2009
IEEE
15 years 8 months ago
2009
IEEE
A precoding strategy for multi-user spectrum sharing over an interference channel is proposed and analyzed from a game-theoretic perspective. The proposed strategy is based on fi...