62 search results - page 12 / 13 » opodis 2007 |
OPODIS
2003
13 years 7 months ago
2003
The Rendezvous of anonymous mobile agents in a anonymous network is an intensively studied problem; it calls for k anonymous, mobile agents to gather in the same site. We study thi...
OPODIS
2003
13 years 7 months ago
2003
Detecting whether a finite execution trace (or a computation) of a distributed program satisfies a given predicate, called predicate detection, is a fundamental problem in distr...
OPODIS
2007
13 years 7 months ago
2007
Abstract. Blin et al. (2006) proposed a distributed protocol that enables the smallest number of searchers to clear any unknown asynchronous graph in a decentralized manner. Unknow...
OPODIS
2007
13 years 7 months ago
2007
Considering an asynchronous system made up of n processes and where up to t of them can crash, finding the weakest assumptions that such a system has to satisfy for a common leade...
OPODIS
2007
13 years 7 months ago
2007
Consider the following game between a worm and an alert3 over a network of n nodes. Initially, no nodes are infected or alerted and each node in the network is a special detector n...