Sciweavers

576 search results - page 74 / 116
» Synchronization of Some DFA
Sort
View
DC
2010
13 years 8 months ago
Refined quorum systems
It is considered good distributed computing practice to devise object implementations that tolerate contention, periods of asynchrony and a large number of failures, but perform f...
Rachid Guerraoui, Marko Vukolic
NETWORKS
2008
13 years 8 months ago
Decontamination of hypercubes by mobile agents
In this paper we consider the decontamination problem in a hypercube network of size n. The nodes of the network are assumed to be contaminated and they have to be decontaminated ...
Paola Flocchini, Miao Jun Huang, Flaminia L. Lucci...
TMC
2008
127views more  TMC 2008»
13 years 8 months ago
Time and Energy Complexity of Distributed Computation of a Class of Functions in Wireless Sensor Networks
We consider a scenario in which a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing a...
Nilesh Khude, Anurag Kumar, Aditya Karnik
TMC
2010
161views more  TMC 2010»
13 years 7 months ago
Schedule Adaptation of Low-Power-Listening Protocols for Wireless Sensor Networks
—Many recent advances in MAC protocols for wireless sensor networks have been proposed to reduce idle listening, an energy wasteful state of the radio. Low-Power-Listening (LPL) ...
Christophe J. Merlin, Wendi B. Heinzelman
FM
2009
Springer
134views Formal Methods» more  FM 2009»
13 years 6 months ago
Partial Order Reductions Using Compositional Confluence Detection
Abstract. Explicit state methods have proven useful in verifying safetycritical systems containing concurrent processes that run asynchronously and communicate. Such methods consis...
Frédéric Lang, Radu Mateescu