Sciweavers

3240 search results - page 146 / 648
» Pre-aggregation with probability distributions
Sort
View
SPAA
2006
ACM
15 years 10 months ago
The cache complexity of multithreaded cache oblivious algorithms
We present a technique for analyzing the number of cache misses incurred by multithreaded cache oblivious algorithms on an idealized parallel machine in which each processor has a...
Matteo Frigo, Volker Strumpen
COORDINATION
2004
Springer
15 years 9 months ago
Probabilistic and Prioritized Data Retrieval in the Linda Coordination Model
Linda tuple spaces are flat and unstructured, in the sense that they do not allow for expressing preferences of tuples; for example, we could be interested in indicating tuples th...
Mario Bravetti, Roberto Gorrieri, Roberto Lucchi, ...
INFOCOM
2003
IEEE
15 years 9 months ago
Kalman Filter Estimation of the Number of Competing Terminals in an IEEE 802.11 network
Abstract— Throughput performance of the IEEE 802.11 Distributed Coordination Function (DCF) is very sensitive to the number n of competing stations. The contribute of this paper ...
Giuseppe Bianchi, Ilenia Tinnirello
121
Voted
CP
2003
Springer
15 years 9 months ago
Terminating Decision Algorithms Optimally
Incomplete decision algorithms can often solve larger problem instances than complete ones. The drawback is that one does not know whether the algorithm will finish soon, later, ...
Tuomas Sandholm
LCN
2002
IEEE
15 years 9 months ago
A New Location Management Strategy Based on User Mobility Pattern for Wireless Networks
For a wireless network to effectively deliver services to the mobile users, it must have an efficient way to track them. The location management fulfills this task through locat...
Wenchao Ma, Yuguang Fang