Sciweavers

3796 search results - page 383 / 760
» The Failure of Personalities to Generalize
Sort
View
ASPLOS
1992
ACM
15 years 11 months ago
Parity Declustering for Continuous Operation in Redundant Disk Arrays
We describe and evaluate a strategy for declustering the parity encoding in a redundant disk array. This declustered parity organization balances cost against data reliability and...
Mark Holland, Garth A. Gibson
IUI
1993
ACM
15 years 11 months ago
Reducing user effort in collaboration support
incompatibility. We introduce Mona, an operational email system embodying this automatic approach. Mona establishes conversation context independently of user actions through the ...
Andy Cockburn, Harold W. Thimbleby
WDAG
1990
Springer
80views Algorithms» more  WDAG 1990»
15 years 11 months ago
Tight Bounds on the Round Complexity of Distributed 1-Solvable Tasks
A distributed task T is 1-solvable if there exists a protocol that solves it in the presence of (at most) one crash failure. A precise characterization of the 1-solvable tasks was...
Ofer Biran, Shlomo Moran, Shmuel Zaks
AOSD
2009
ACM
15 years 11 months ago
Flexible calling context reification for aspect-oriented programming
Aspect-oriented programming (AOP) eases the development of profilers, debuggers, and reverse engineering tools. Such tools frequently rely on calling context information. However,...
Alex Villazón, Walter Binder, Philippe More...
EMNETS
2007
15 years 10 months ago
Robust node localization for wireless sensor networks
The node localization problem in Wireless Sensor Networks has received considerable attention, driven by the need to obtain a higher location accuracy without incurring a large, p...
Radu Stoleru, John A. Stankovic, Sang Hyuk Son