Sciweavers

1134 search results - page 145 / 227
» Distributed Proving in Access-Control Systems
Sort
View
134
Voted
WDAG
2007
Springer
128views Algorithms» more  WDAG 2007»
15 years 9 months ago
From Crash-Stop to Permanent Omission: Automatic Transformation and Weakest Failure Detectors
Abstract. This paper studies the impact of omission failures on asynchronous distributed systems with crash-stop failures. We provide two different transformations for algorithms,...
Carole Delporte-Gallet, Hugues Fauconnier, Felix C...
115
Voted
JSSPP
2005
Springer
15 years 9 months ago
Co-scheduling with User-Settable Reservations
As grid computing becomes more commonplace, so does the importance of coscheduling these geographically distributed resourcest. Negotiating resource management and scheduling deci...
Kenneth Yoshimoto, Patricia A. Kovatch, Phil Andre...
140
Voted
ICPPW
2002
IEEE
15 years 8 months ago
Localized Group Membership Service for Ad Hoc Networks
We present a specification for a new, localized group membership service that maintains the membership status of adjacent nodes – called neighbors – in a mobile distributed s...
Linda Briesemeister, Günter Hommel
PODC
2009
ACM
15 years 8 months ago
Brief announcement: locality-based aggregate computation in wireless sensor networks
We present DRR-gossip, an energy-efficient and robust aggregate computation algorithm in wireless sensor networks. We prove that the DRR-gossip algorithm requires O(n) messages a...
Jen-Yeu Chen, Gopal Pandurangan, Jianghai Hu
139
Voted
CONCUR
1999
Springer
15 years 8 months ago
Validating Firewalls in Mobile Ambients
Abstract. The ambient calculus is a calculus of computation that allows active processes (mobile ambients) to move between sites. A firewall is said to be protective whenever it d...
Flemming Nielson, Hanne Riis Nielson, René ...