Sciweavers

2924 search results - page 75 / 585
» Lower Bounds in Distributed Computing
Sort
View
ATAL
2008
Springer
13 years 11 months ago
On k-optimal distributed constraint optimization algorithms: new bounds and algorithms
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...
Emma Bowring, Jonathan P. Pearce, Christopher Port...
KDID
2004
134views Database» more  KDID 2004»
13 years 10 months ago
Theoretical Bounds on the Size of Condensed Representations
Abstract. Recent studies demonstrate the usefulness of condensed representations as a semantic compression technique for the frequent itemsets. Especially in inductive databases, c...
Nele Dexters, Toon Calders
IPPS
1999
IEEE
14 years 1 months ago
The Recursive Grid Layout Scheme for VLSI Layout of Hierarchical Networks
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...
Chi-Hsiang Yeh, Behrooz Parhami, Emmanouel A. Varv...
DCC
2006
IEEE
14 years 8 months ago
Asymptotic Nonlinearity of Boolean Functions
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...
François Rodier
DCC
2010
IEEE
13 years 9 months ago
Minimum distance of Hermitian two-point codes
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...
Seungkook Park