Sciweavers

2473 search results - page 83 / 495
» The Logic of Communication Graphs
Sort
View
CDC
2010
IEEE
152views Control Systems» more  CDC 2010»
13 years 2 months ago
Optimal network topology design in multi-agent systems for efficient average consensus
The problem considered in the present article is optimal design of network topologies in multi-agent systems in order to make communication on the network as efficient as possible ...
Mohammad Rafiee, Alexandre M. Bayen
PODC
2006
ACM
14 years 1 months ago
Object location using path separators
We study a novel separator property called k-path separable. Roughly speaking, a k-path separable graph can be recursively separated into smaller components by sequentially removi...
Ittai Abraham, Cyril Gavoille
ASYNC
1997
IEEE
123views Hardware» more  ASYNC 1997»
13 years 12 months ago
On the Realisation of Delay-Insensitive Asynchronous Circuits with CMOS Ternary Logic
The realisation of Delay-Insensitive (DI) asynchronous circuits with a CMOS ternary logic is described in this paper. The main advantage of temary logic is the easy realisation of...
Riccardo Mariani, Roberto Roncella, Roberto Salett...
SYNTHESE
2010
133views more  SYNTHESE 2010»
13 years 2 months ago
Dynamic logics of knowledge and access
A recurring issue in any formal model representing agents' (changing) informational attitudes is how to account for the fact that the agents are limited in their access to the...
Tomohiro Hoshi, Eric Pacuit
DAC
2006
ACM
14 years 8 months ago
State encoding of large asynchronous controllers
A novel method to solve the state encoding problem in Signal Transition Graphs is presented. It is based on the structural theory of Petri nets and can be applied to large specifi...
Josep Carmona, Jordi Cortadella