34 search results - page 5 / 7 » Complexity of scheduling with analog network coding |
EVOW
2009
Springer
14 years 1 months ago
2009
Springer
In this paper we propose a new tabu search hyperheuristic which makes individual low level heuristics tabu dynamically using an analogy with the Binary Exponential Back Off (BEBO) ...
MOBIHOC
2006
ACM
14 years 6 months ago
2006
ACM
This paper presents a distributed implementation of RAND, a randomized time slot scheduling algorithm, called DRAND. DRAND runs in O() time and message complexity where is the max...
NCA
2005
IEEE
14 years 5 days ago
2005
IEEE
This paper deals with general nested loops and proposes a novel scheduling methodology for reducing the communication cost of parallel programs. General loops contain complex loop...
ICC
2009
IEEE
14 years 1 months ago
2009
IEEE
— Both fast scheduling and spatial signal processing have proven to be capacity-increasing methods in wireless communication systems. However, when applied in the downlink of a c...
TWC
2008
13 years 6 months ago
2008
Abstract--Orthogonal random beamforming (ORB) constitutes a mean to exploit spatial multiplexing and multi-user diversity (MUD) gains in multi-antenna broadcast channels. To do so,...