Sciweavers

727 search results - page 68 / 146
» A Calculus of Bounded Capacities
Sort
View
PIMRC
2008
IEEE
15 years 10 months ago
Multiuser diversity in channels with limited scatterers
—Multiuser diversity scheduling is studied in a single cell system with a limited scatterers channel. The scheduler implements the proportional fairness algorithm with infinite ...
Kimmo Kansanen, Ralf R. Müller
INFORMS
2008
241views more  INFORMS 2008»
15 years 4 months ago
Solving the Capacitated Local Access Network Design Problem
We propose an exact solution method for a routing and capacity installation problem in networks. Given an input graph, the problem is to route traffic from a set of source nodes t...
F. Sibel Salman, R. Ravi, John N. Hooker
JSAC
2007
87views more  JSAC 2007»
15 years 4 months ago
Scheduling of Multi-Antenna Broadcast Systems with Heterogeneous Users
— We consider a two transmit antenna broadcast system with heterogeneous users, and tackle the problem of maximizing a weighted sum rate. We establish a novel upper bound for the...
Krishna P. Jagannathan, Sem C. Borst, Philip A. Wh...
TIT
2011
98views more  TIT 2011»
14 years 11 months ago
Information Rates for Multiantenna Systems With Unknown Fading
—This work first presents a general technique to compute tight upper and lower bounds on the information rate of a multiuser Rayleigh fading channel with no Channel State Inform...
Krishnan Padmanabhan, Sundeep Venkatraman, Oliver ...
COCOON
2008
Springer
15 years 6 months ago
Approximating the Generalized Capacitated Tree-Routing Problem
In this paper, we introduce the generalized capacitated tree-routing problem (GCTR), which is described as follows. Given a connected graph G = (V, E) with a sink s V and a set M...
Ehab Morsy, Hiroshi Nagamochi