TMC
2010
13 years 2 months ago
2010
—Network coding is an attracting technology that has been shown to be able to improve the throughput of wireless networks. However, there still lacks fundamental understanding on...
INFOCOM
2010
IEEE
13 years 2 months ago
2010
IEEE
— Most of the previous work on network coding has assumed that the users are not selfish and always follow the designed coding schemes. However, recent results have shown that s...
CORR
2010
Springer
13 years 2 months ago
2010
Springer
This paper develops upper bounds on the end-to-end transmission capacity of multi-hop wireless networks. Potential source-destination paths are dynamically selected from a pool of...
CORR
2010
Springer
13 years 3 months ago
2010
Springer
In this paper, following the way opened by a previous paper deposited on arXiv, see[7], we give an upper bound to the number of states for a hyperbolic cellular automaton in the pe...
COMBINATORICA
2007
13 years 3 months ago
2007
A complete partition of a graph G is a partition of its vertex set in which any two distinct classes are connected by an edge. Let cp(G) denote the maximum number of classes in a ...
TPDS
1998
13 years 4 months ago
1998
—A bus oriented network where there is a charge for the amount of divisible load processed on each processor is investigated. A cost optimal processor sequencing result is found ...
SIU
2002
13 years 4 months ago
2002
In this study we analyze the performance of a Lagrangean relaxation upper bound for the problem of packing the maximum number of rectangles of sizes
TIT
1998
13 years 4 months ago
1998
— The lower and upper bounds for the information capacity of two-layer feedforward neural networks with binary interconnections, integer thresholds for the hidden units, and zero...
MOC
2002
13 years 4 months ago
2002
A new upper bound is provided for the L-norm of the difference between the viscosity solution of a model steady state Hamilton-Jacobi equation, u, and any given approximation, v. T...
DCG
1999
13 years 4 months ago
1999
This paper presents a new lower bound of 2:414d= p d on the maximal number of Nash equilibria in d d bimatrix games, a central concept in game theory. The proof uses an equivalent ...