Sciweavers

8780 search results - page 231 / 1756
» On the Feasibility of Consistent Computations
Sort
View
TCS
2008
15 years 7 months ago
A unified approach to finding good stable matchings in the hospitals/residents setting
The hospitals/residents (HR) problem is a many-to-one generalization of the stable marriage (SM) problem. Researchers have been interested in variants of stable matchings that eit...
Christine Cheng, Eric McDermid, Ichiro Suzuki
ICDCSW
2002
IEEE
16 years 6 days ago
A Demand based Algorithm for Rapid Updating of Replicas
In many Internet scale replicated system, not all replicas can be dealt with in the same way, since some will be in greater demand than others. In the case of weak consistency algo...
Jesús Acosta-Elías, Leandro Navarro-...
PPAM
2001
Springer
15 years 11 months ago
Estimating Execution Time of Distributed Applications
In this work we consider the problem of estimating execution time of distributed applications. The main difficulty stems from the communication delays and shared nature of the comp...
Maciej Drozdowski
ER
1998
Springer
127views Database» more  ER 1998»
15 years 11 months ago
Rumor: Mobile Data Access Through Optimistic Peer-to-Peer Replication
1 Rumor is an optimistically replicated le system designed for use in mobile computers. Rumor uses a peer model that allows opportunistic update propagation among any sites replica...
Richard G. Guy, Peter L. Reiher, David Ratner, Mic...
CG
2004
Springer
15 years 7 months ago
A barcode shape descriptor for curve point cloud data
In this paper, we present a complete computational pipeline for extracting a compact shape descriptor for curve point cloud data. Our shape descriptor, called a barcode, is based ...
Anne D. Collins, Afra Zomorodian, Gunnar Carlsson,...