Suppose we have a directed graph G with set of nodes V = {1, . . . , N} and a measure xi for every node i V . The average consensus problem consists in computing the average xA = ...
: In this paper, functioning and interaction of distributed devices and concurrent algorithms are analyzed in the context of the theory of algorithms. Although different systems in...
In this paper, we propose a peer-to-peer approach to derive and obtain additional context data from lowlevel context data that may be spread over multiple domains in pervasive com...
This paper describes the development of a software tool for detection of vulnerabilities in networked systems, using public available security resources. Our tool builds is knowle...
We consider the task of network exploration by a mobile agent (robot) with small memory. The agent has to traverse all nodes and edges of a network (represented as an undirected c...