2374 search results - page 294 / 475 » Fast Distributed Algorithms for Computing Separable Function... |
98
Voted
IPPS
1999
IEEE
15 years 7 months ago
1999
IEEE
Abstract. We propose a prediction-based best-effort real-time service to support distributed, interactive applications in shared, unreserved computing environments. These applicati...
137
Voted
STACS
2000
Springer
15 years 6 months ago
2000
Springer
Abstract. We compare classical and quantum query complexities of total Boolean functions. It is known that for worst-case complexity, the gap between quantum and classical can be a...
115
Voted
TNN
2011
14 years 9 months ago
2011
—Prediction intervals (PIs) have been proposed in the literature to provide more information by quantifying the level of uncertainty associated to the point forecasts. Traditiona...
164
Voted
CCGRID
2010
IEEE
15 years 5 days ago
2010
IEEE
Data-intensive parallel applications on clouds need to deploy large data sets from the cloud's storage facility to all compute nodes as fast as possible. Many multicast algori...
115
click to vote
IPPS
2006
IEEE
15 years 8 months ago
2006
IEEE
Most programs are repetitive, where similar behavior can be seen at different execution times. Algorithms have been proposed that automatically group similar portions of a program...