Sciweavers

3495 search results - page 326 / 699
» On the random satisfiable process
Sort
View
IPPS
2007
IEEE
16 years 1 months ago
Implementing OLAP Query Fragment Aggregation and Recombination for the OLAP Enabled Grid
In this paper we propose a new query processing method for the OLAP Enabled Grid, which blends sophisticated cache extraction techniques and data grid scheduling to efficiently s...
Michael Lawrence, Frank K. H. A. Dehne, Andrew Rau...
IPPS
2000
IEEE
15 years 11 months ago
Consensus Based on Failure Detectors with a Perpetual Accuracy Property
This paper is on the Consensus problem, in the context of asynchronous distributed systems made of n processes, at most f of them may crash. A family of failure detector classes s...
Achour Mostéfaoui, Michel Raynal
PODC
1993
ACM
15 years 11 months ago
A Lower Bound on Wait-Free Counting
A counting protocol (mod m) consists of shared memory bits - referred to as the counter - and of a procedure for incrementing the counter value by 1 (mod m). The procedure may be ...
Shlomo Moran, Gadi Taubenfeld
ECIS
2001
15 years 8 months ago
Avoiding Failure in SPI Initiation
Software Process Improvement (SPI) is a recognised systematic approach for improving the capability of software organisations. Such initiatives have met with a number of difficult...
Pouya Pourkomeylian
WSC
2004
15 years 8 months ago
Approximating Component Selection
Simulation composability is a difficult capability to achieve due to the challenges of creating components, selecting combinations of components, and integrating the selected comp...
Michael Roy Fox, David C. Brogan, Paul F. Reynolds...