Sciweavers

6004 search results - page 759 / 1201
» Parallelizing query optimization
Sort
View
PODC
1997
ACM
15 years 8 months ago
The Load and Availability of Byzantine Quorum Systems
Replicated services accessed via quorums enable each access to be performed at only a subset (quorum) of the servers and achieve consistency across accesses by requiring any two qu...
Dahlia Malkhi, Michael K. Reiter, Avishai Wool
EUROPAR
2006
Springer
15 years 7 months ago
Creating and Maintaining Replicas in Unstructured Peer-to-Peer Systems
Abstract. In peer-to-peer systems, replication is an important issue as it improves search performance and data availability. It has been shown that optimal replication is attained...
Elias Leontiadis, Vassilios V. Dimakopoulos, Evagg...
CCGRID
2001
IEEE
15 years 7 months ago
A DSM Cluster Architecture Supporting Aggressive Computation in Active Networks
Active networks allow computations to be performed innetwork at routers as messages pass through them. Active networks offer unique opportunities to optimize networkcentric applic...
Peter C. J. Graham
FSTTCS
1995
Springer
15 years 7 months ago
Branch and Bound on the Network Model
Karp and Zhang developed a general randomized parallel algorithm for solving branch and bound problems. They showed that with high probability their algorithm attained optimal spe...
Sanjay Jain
DCOSS
2010
Springer
15 years 7 months ago
Approximate Distributed Kalman Filtering for Cooperative Multi-agent Localization
Abstract. We consider the problem of estimating the locations of mobile agents by fusing the measurements of displacements of the agents as well as relative position measurements b...
Prabir Barooah, Wm. Joshua Russell, João P....