210 search results - page 10 / 42 » Excludability and Bounded Computational Capacity |
WCNC
2010
IEEE
14 years 1 months ago
2010
IEEE
Abstract—The paper addresses wireless the 2-Way Relay Channel (2-WRC) system with a Hierarchical Decode and Forward strategy. This strategy uses a Hierarchical eXclusive Code (HX...
WIOPT
2010
IEEE
13 years 8 months ago
2010
IEEE
—It has been shown that the well-known cutset bounds can be achieved for deterministic wireless networks by performing random coding at each intermediate node. The complexity and...
TC
2010
13 years 4 months ago
2010
In this paper, we define and study a new class of capacity planning models called MAP queueing networks. MAP queueing networks provide the first analytical methodology to describe ...
FSTTCS
2009
Springer
14 years 4 months ago
2009
Springer
We investigate the parameterized complexity of generalisations and variations of the dominating set problem on classes of graphs that are nowhere dense. In particular, we show that...
MOBIHOC
2008
ACM
14 years 9 months ago
2008
ACM
We address the cost incurred in increasing the transport capacity of wireless ad hoc networks over what can be attained when sources and destinations communicate over multi-hop pa...