806 search results - page 75 / 162 » Lower Bounds on Correction Networks |
166
click to vote
STOC
1996
ACM
15 years 10 months ago
1996
ACM
A linear array network consists of k + 1 processors P0; P1; : : : ; Pk with links only between Pi and Pi+1 0 i k. It is required to compute some boolean function f x; y in this n...
184
click to vote
NETWORKS
2008
15 years 6 months ago
2008
The resource-constrained elementary shortest path problem arises as a pricing subproblem in branch-and-price algorithms for vehicle routing problems with additional constraints. W...
186
click to vote
DC
2010
15 years 6 months ago
2010
We present a novel distributed algorithm for the maximal independent set (MIS) problem.1 On bounded-independence graphs (BIG) our deterministic algorithm finishes in O(log n) time,...
146
click to vote
LMCS
2007
15 years 5 months ago
2007
Higher-Order Fixpoint Logic (HFL) is a hybrid of the simply typed λ-calculus and the modal µ-calculus. This makes it a highly expressive temporal logic that is capable of express...
169
click to vote
WIOPT
2006
IEEE
16 years 1 days ago
2006
IEEE
Abstract— The objective of the paper is to provide qualitative insight into the global effects of distributed mechanisms, such as carrier sense multiple access (CSMA) and rate co...