Shehla Abbas

Learn More
In this paper, we investigate the following problem: k mobile agents are placed on a graph G. Each agent performs a random walk, and when two or more agents meet at a node, they merge into a single agent. We present a Markov chain modeling the agents behaviour and show how this can be used to upper bound the expected time for all the k agents to merge into(More)
In this report, we investigate the following problem: k mobile agents are placed in a network of processors. Each agent has a limited knowledge and moves randomly in the network which means that the agents are not intelligent and do not have computational capabilities. When the agents meet in a node of the underlying graph, they merge in a single agent and(More)
  • 1