2957 search results - page 345 / 592 » The Complexity of Polynomial-Time Approximation |
149
click to vote
ICASSP
2009
IEEE
16 years 1 months ago
2009
IEEE
A computationally efficient distributed beamforming technique for multi-user relay networks is developed. The channel state information is assumed to be known at the relays or de...
225
click to vote
IEEEICCI
2009
IEEE
16 years 1 months ago
2009
IEEE
An interval set is an interval in the power set lattice based on a universal set and is a family of subsets of the universal set. Interval sets and interval-set algebras provide a...
159
click to vote
IPPS
2009
IEEE
16 years 1 months ago
2009
IEEE
In this paper, we deal with the large-scale divisible load problem studied in [12]. We show how to reduce this problem to a classical preemptive scheduling problem on a single mac...
187
click to vote
SAGA
2009
Springer
16 years 1 months ago
2009
Springer
Stochastic programming problems appear as mathematical models for optimization problems under stochastic uncertainty. Most computational approaches for solving such models are base...
159
click to vote
ICASSP
2008
IEEE
16 years 1 months ago
2008
IEEE
We consider a pilot-assisted interleave-division multiple access (IDMA) system transmitting over block-fading channels. We describe this system in terms of a factor graph and use ...