Learn More
The past few years have seen intensive research efforts carried out in some apparently unrelated areas of dynamic systems – delay-tolerant networks, opportunistic-mobility networks, social networks – obtaining closely related insights. Indeed, the concepts discovered in these investigations can be viewed as parts of the same conceptual universe; and the(More)
Consider a team of mobile software agents deployed to capture a (possibly hostile) intruder in a network. All agents, including the intruder move along the network links; the intruder could be arbitrarily fast, and aware of the positions of all the agents. The problem is to design the agents' strategy for capturing the intruder. The main efficiency(More)
From an engineering point of view, the problem of coordinating a set of autonomous, mobile robots for the purpose of cooperatively performing a task has been studied extensively over the past decade. In contrast, in this paper we aim at an understanding of the fundamental algorithmic limitations on what a set of autonomous mobile robots can or cannot(More)
Consider a set of n > 2 simple autonomous mobile robots (decentralized, asyn-chronous, no common coordinate system, no identities, no central coordination, no direct communication, no memory of the past, deterministic) moving freely in the plane and able to sense the positions of the other robots. We study the primitive task of gathering them at a point not(More)
A simple implementation of double-ended priority queues is presented. The proposed structure, called a min-max heap, can be built in linear time; in contrast to conventional heaps, it allows both</italic> FindMin <italic>and</italic> FindMax <italic>to be performed in constant time;</italic> Insert, DeleteMin, <italic>and</italic> DeleteMax(More)
We consider the problem of exploring an anonymous unoriented ring by a team of k identical, oblivious, asynchronous mobile robots that can view the environment but cannot communicate. This weak scenario is standard when the spatial universe in which the robots operate is the two-dimensional plane, but (with one exception) has not been investigated before(More)
In this paper we consider a continuous version of cellular automata (Fuzzy CA) obtained by " fuzzification " of the disjunctive normal form which describes the corresponding Boolean rule. We concentrate on Fuzzy rule 90, whose Boolean version has deserved some attention for the complex patterns it generates. We show that the behavior of Fuzzy rule 90 is(More)