1205 search results - page 117 / 241 » On P Systems with Bounded Parallelism |
149
click to vote
SPAA
1998
ACM
15 years 10 months ago
1998
ACM
We present parallel algorithms for union, intersection and difference on ordered sets using random balanced binary trees (treaps [26]). For two sets of size n and m (m ≤ n) the...
164
click to vote
DBISP2P
2003
Springer
15 years 11 months ago
2003
Springer
The popularity of peer-to-peer search networks continues to grow, even as the limitations to the scalability of existing systems become apparent. We propose a simple model for sear...
198
click to vote
TSP
2010
15 years 1 months ago
2010
We study the estimation of a Gaussian source by a Gaussian wireless sensor network (WSN) where L distributed sensors transmit noisy observations of the source through a fading Gau...
177
click to vote
WOMPAT
2001
Springer
15 years 10 months ago
2001
Springer
Clusters of high-end workstations and PCs are currently used in many application domains to perform large-scale computations or as scalable servers for I/O bound tasks. Although cl...
171
click to vote
PARLE
1994
15 years 10 months ago
1994
Abstract. As the disparity between processor and memory speed continues to widen, the exploitation of locality of reference in shared-memory multiprocessors becomes an increasingly...