majority rule of each node on its neighbors' states. In our model, the network is a chordal ring. We establish lower and upper bounds on the number of initial faults of dynamos, and we fully characterize their structure for specic classes of chordal rings, namely weakly and strongly chorded rings

This book presents a unified treatment of many different kinds of planning algorithms. The subject lies at the crossroads between robotics, control theory, artificial intelligence, algorithms, and computer graphics. The particular subjects covered include motion planning, discrete planning, planning under uncertainty, sensor-based planning, visibility, decision-theoretic planning, game theory, information spaces, reinforcement learning, nonlinear systems, trajectory planning, nonholonomic planning, and kinodynamic planning.

Abstract not found

Abstract not found

We study the dynamics of majority-based distributed systems in presence of permanent faults. In particular, we are interested in the patterns of initial faults which may lead the entire system to a faulty behaviour. Such patterns are called dynamos and their properties have been studied in many

Abstract not found

We study the propagation of information in a network in the presence of permanent faults, to detect the patterns of initial faults which may lead the entire system to fail. Such patterns, called dynamos, have been already studied in different contexts and topologies, and under different laws

Abstract not found

Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at

This paper deals with the design of multi-(micro)computer interconnection networks modelled by graphs. In particular we concentrate upon the optimization of a new family of such networks that turn out to be a generalization of the well-known Arden and Lee's chordal ring networks