Bayesian networks, equivalently graphical Markov models determined by acyclic digraphs or ADGs (also called directed acyclic graphs or dags), have proved to be both effective and ...
Streams are acyclic directed subgraphs of the logical ow graph of a proof representing bundles of paths with the same origin and the same end. The notion of stream is used to desc...
— This paper proposes distributed control laws for maintaining the shape of a formation of mobile autonomous agents in the plane for which the desired shape is defined in terms ...
Ming Cao, Brian D. O. Anderson, A. Stephen Morse, ...
We describe the query and data processing language QUOGGLES which is particularly designed for the application on graphs. It uses a pipeline-like technique known from command line ...
Given a set S of elements in a directed network that are initially faulty, an element becomes (functionally) faulty if all its in-neighbors or all its outneighbors are (functional...