Wyniki wyszukiwania dla: PROBLEM RENDEZVOUS

• Ekonomiczne Problemy Usług

  Czasopisma

  ISSN: 1640-6818 , eISSN: 1896-382X

• Problemy Jakości

  Czasopisma

  ISSN: 0137-8651 , eISSN: 2449-9862

• Problemy Zarządzania

  Czasopisma

  ISSN: 1644-9584 , eISSN: 2300-8792

• Problemy Kolejnictwa

  Czasopisma

  ISSN: 0552-2145

• Deterministic Rendezvous in Restricted Graphs

  Publikacja

  • A. Farrugia
  • L. Gąsieniec
  • Ł. Kuszner
  • E. Pacheco

  - Rok 2015

  In this paper we consider the problem of synchronous rendezvous in which two anonymous mobile entities (robots) A and B are expected to meet at the same time and point in a graph G = (V;E). Most of the work devoted to rendezvous in graphs assumes that robots have access to the same sets of nodes and edges, where the topology of connections may be initially known or unknown. In our work we assume the movement of robots is restricted...

  Pełny tekst do pobrania w serwisie zewnętrznym

• A solution of non-linear differential problem with application to selected geotechnical problems

  Publikacja

  • A. Milewska

  - Archives of Civil Engineering - Rok 2011

  A certain non-linear differential equation containing a power of unknown function being the solution is considered with application to selected geotechnical problems. The equation can be derived to a linear differential equation by a proper substitution and properties of the operations G and S.

  Pełny tekst do pobrania w portalu

• Rendezvous of heterogeneous mobile agents in edge-weighted networks

  Publikacja

  • D. Dereniowski
  • R. Klasing
  • A. Kosowski
  • Ł. Kuszner

  - THEORETICAL COMPUTER SCIENCE - Rok 2015

  We introduce a variant of the deterministic rendezvous problem for a pair of heterogeneous agents operating in an undirected graph, which differ in the time they require to traverse particular edges of the graph. Each agent knows the complete topology of the graph and the initial positions of both agents. The agent also knows its own traversal times for all of the edges of the graph, but is unaware of the corresponding traversal...

  Pełny tekst do pobrania w portalu

• Rendezvous of Distance-Aware Mobile Agents in Unknown Graphs

  Publikacja

  • S. Das
  • D. Dereniowski
  • A. Kosowski
  • P. Uznański

  - Rok 2014

  We study the problem of rendezvous of two mobile agents starting at distinct locations in an unknown graph. The agents have distinct labels and walk in synchronous steps. However the graph is unlabelled and the agents have no means of marking the nodes of the graph and cannot communicate with or see each other until they meet at a node. When the graph is very large we want the time to rendezvous to be independent of the graph size...

  Pełny tekst do pobrania w serwisie zewnętrznym

• Rendezvous of Heterogeneous Mobile Agents in Edge-Weighted Networks

  Publikacja

  • D. Dereniowski
  • Ł. Kuszner
  • A. Kosowski
  • R. Klasing

  - Rok 2014

  We introduce a variant of the deterministic rendezvous problem for a pair of heterogeneous agents operating in an undirected graph, which differ in the time they require to traverse particular edges of the graph. Each agent knows the complete topology of the graph and the initial positions of both agents. The agent also knows its own traversal times for all of the edges of the graph, but is unaware of the corresponding traversal...

  Pełny tekst do pobrania w serwisie zewnętrznym

• Physicochemical Problems of Mineral Processing

  Czasopisma

  ISSN: 1643-1049 , eISSN: 2084-4735