256 search results - page 11 / 52 » A New Synchronous Lower Bound for Set Agreement |
COMBINATORICS
1999
13 years 7 months ago
1999
Let G = (V, E) be an undirected graph. Let C be a subset of vertices that we shall call a code. For any vertex v V , the neighbouring set N(v, C) is the set of vertices of C at d...
ICC
2007
IEEE
14 years 2 months ago
2007
IEEE
— Relaying diversity is a key technology to increase capacity in wireless networks. In this paper, the capacity of a single source-destination wireless channel, aided by a set of...
HICSS
2002
IEEE
14 years 24 days ago
2002
IEEE
—Connected dominating set (CDS) has been proposed as virtual backbone or spine of wireless ad hoc networks. Three distributed approximation algorithms have been proposed in the l...
CPAIOR
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. The NValue constraint counts the number of different values assigned to a vector of variables. Propagating generalized arc consistency on this constraint is NP-hard. We ...
DCC
2010
IEEE
13 years 8 months ago
2010
IEEE
In [8], the authors formulate new coset bounds for algebraic geometric codes. The bounds give improved lower bounds for the minumum distance of algebraic geometric codes as well a...