806 search results - page 152 / 162 » Lower Bounds on Correction Networks |
103
click to vote
INFOCOM
2007
IEEE
15 years 6 months ago
2007
IEEE
— We propose a general family of MAC scheduling algorithms that achieve any rate-point on a uniform discretelattice within the throughput-region (i.e., lattice-throughputoptimal)...
HM
2007
Springer
15 years 6 months ago
2007
Springer
The connected facility location (ConFL) problem generalizes the facility location problem and the Steiner tree problem in graphs. Given a graph G = (V, E), a set of customers D ⊆...
WDAG
2005
Springer
15 years 5 months ago
2005
Springer
We investigate issues related to the probe complexity of the And-Or quorum system and its implementation in a dynamic environment. Our contribution is twofold: We first analyze th...
130
click to vote
SPAA
1999
ACM
15 years 4 months ago
1999
ACM
The time-constrained packet routing problem is to schedule a set of packets to be transmitted through a multinode network, where every packet has a source and a destination (as in ...
113
click to vote
SIAMCOMP
2000
14 years 11 months ago
2000
This paper describes a scheme to implement a shared address space of size m on an n-node mesh, with m polynomial in n, where each mesh node hosts a processor and a memory module. A...