The problem of verifying a Minimum Spanning Tree (MST) was introduced by Tarjan in a sequential setting. Given a graph and a tree that spans it, the algorithm is required to check...
In the real-time environments, information is disseminated to clients with timing constraint. In this paper, we focus on the real time data scheduling problem in multiple broadcas...
Obtaining location information by localization schemes for sensor nodes makes applications of wireless sensor networks (WSNs) more meaningful. Most of localization schemes only us...
Our proposal has the following key features: 1) The separation of a distributed program into a pure algorithm (PurAl) and a distribution/communication declaration (DUAL). This yie...
Raphael B. Yehezkael, Yair Wiseman, H. G. Mendelba...
Quality of service (QoS) is becoming an attractive feature for high-performance networks and parallel machines because it could allow a more efficient use of resources. Deadline-...