Wyniki wyszukiwania dla: ANONYMOUS AGENTS - MOST Wiedzy

Wyszukiwarka

Wyniki wyszukiwania dla: ANONYMOUS AGENTS

Wyniki wyszukiwania dla: ANONYMOUS AGENTS

  • Leader election for anonymous asynchronous agents in arbitrary networks

    Publikacja

    - DISTRIBUTED COMPUTING - Rok 2014

    We consider the problem of leader election among mobile agents operating in an arbitrary network modeled as an undirected graph. Nodes of the network are unlabeled and all agents are identical. Hence the only way to elect a leader among agents is by exploiting asymmetries in their initial positions in the graph. Agents do not know the graph or their positions in it, hence they must gain this knowledge by navigating in the graph...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Time versus space trade-offs for randezvous in trees

    Publikacja

    - DISTRIBUTED COMPUTING - Rok 2014

    Two identical (anonymous) mobile agents start from arbitrary nodes of an unknown tree and have to meet at some node. Agents move in synchronous rounds: in each round an agent can either stay at the current node or move to one of its neighbors. We consider deterministic algorithms for this rendezvous task. The main result of this paper is a tight trade-off between the optimal time of completing rendezvous and the size of memory...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Deterministic rendezvous of asynchronous bounded-memory agents in polygonal terrains

    Publikacja

    - LECTURE NOTES IN COMPUTER SCIENCE - Rok 2010

    Two mobile agents, modeled as points starting at differentlocations of an unknown terrain, have to meet. The terrain is a polygon with polygonal holes. We consider two versions of this rendezvous problem: exact RV, when the points representing the agents have to coincide at some time, and epsilon-RV, when these points have to get at distance less than epsilon in the terrain. In any terrain, each agent chooses its trajectory, but...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • How to meet when you forget: log-space rendezvous in arbitrary graphs

    Publikacja

    - DISTRIBUTED COMPUTING - Rok 2011

    Two identical (anonymous) mobile agents start from arbitrary nodes in an a priori unknown graph and move synchronously from node to node with the goal of meeting. This rendezvous problem has been thoroughly studied, both for anonymous and for labeled agents, along with another basic task, that of exploring graphs by mobile agents. The rendezvous problem is known to be not easier than graph exploration. A well-known recent result...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Reputacja i zaufanie w systemach teleinformatycznych z podmiotami anonimowymi  podejście dynamiczne

    Abstrakcją współczesnego systemu teleinformatycznego jest system wieloagentowy z autonomicznymi, racjonalnymi i wirtualnie anonimowymi agentami wchodzącymi we wzajemne interakcje dla wymiany usług. W referacie uzasadniono konieczność projektowania dla niego podsystemu budowy reputacji i zaufania oraz odpowiednich analiz w ujęciu dynamicznym. Dokonano przeglądu motywacyjnie zgodnych mechanizmów uczciwego raportowania usług oraz...