This paper proves a necessary and sufficient condition for the existence of iterative algorithms that achieve approximate Byzantine consensus in arbitrary directed graphs, where e...
We consider a distributed multi-agent network system where the goal is to minimize a sum of agent objective functions subject to a common set of constraints. For this problem, we p...
S. Sundhar Ram, Angelia Nedic, Venugopal V. Veerav...
Abstract. Asynchronous communications are prominent in distributed and mobile systems. Often consystems consider an abstract point of view with synchronous communications. However ...
We are concerned with the use of Mobile Agents for information retrieval. A multi-agent system is considered; a number of agents are involved in a collective effort to retrieve di...
Covert channel attacks utilize shared resources to indirectly transmit sensitive information to unauthorized parties. Current security mechanisms such as SELinux rely on tagging th...
Yung-Chuan Lee, Stephen Bishop, Hamed Okhravi, Sha...