2924 search results - page 75 / 585 » Lower Bounds in Distributed Computing |
122
Voted
ATAL
2008
Springer
15 years 2 months ago
2008
Springer
Distributed constraint optimization (DCOP) is a promising approach to coordination, scheduling and task allocation in multi agent networks. In large-scale or low-bandwidth network...
107
Voted
KDID
2004
15 years 2 months ago
2004
Abstract. Recent studies demonstrate the usefulness of condensed representations as a semantic compression technique for the frequent itemsets. Especially in inductive databases, c...
117
Voted
IPPS
1999
IEEE
15 years 5 months ago
1999
IEEE
We propose the recursive grid layout scheme for deriving efficient layouts of a variety of hierarchical networks and computing upper bounds on the VLSI area of general hierarchica...
78
Voted
DCC
2006
IEEE
16 years 7 days ago
2006
IEEE
Boolean functions on the space Fm 2 are not only important in the theory of error-correcting codes, but also in cryptography. In these two cases, the nonlinearity of these functio...
96
Voted
DCC
2010
IEEE
15 years 22 days 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...