Sciweavers

24554 search results - page 179 / 4911
» Dependable distributed systems
Sort
View
EUROPAR
2005
Springer
15 years 11 months ago
Replication Predicates for Dependent-Failure Algorithms
Abstract. To establish lower bounds on the amount of replication, there is a common partition argument used to construct indistinguishable executions such that one violates some pr...
Flavio Paiva Junqueira, Keith Marzullo
ISPA
2004
Springer
15 years 11 months ago
Location-Dependent Query Results Retrieval in a Multi-cell Wireless Environment
The demand of information services is popular in recent years. However, the requested of correct answer in a mobile environment needs to have more attentions. This is due to the sc...
James Jayaputera, David Taniar
CORR
2007
Springer
117views Education» more  CORR 2007»
15 years 6 months ago
Dependable k-coverage algorithms for sensor networks
– Redundant sensing capabilities are often required in sensor network applications due to various reasons, e.g. robustness, fault tolerance, or increased accuracy. At the same ti...
Simon Gyula, Miklós Molnár, Lá...
ATAL
2009
Springer
15 years 7 months ago
Conditional Dependence Networks in Requirements Engineering
In this paper we present a new model for the requirements analysis of a system. We offer a conceptual model defined following a visual modeling language, called dependence networks...
Guido Boella, Leendert van der Torre, Serena Villa...
IPTPS
2003
Springer
15 years 11 months ago
Understanding Availability
This paper addresses a simple, yet fundamental question in the design of peer-to-peer systems: What does it mean when we say “availability” and how does this understanding imp...
Ranjita Bhagwan, Stefan Savage, Geoffrey M. Voelke...