Zobrazeno 1 - 10
of 239
pro vyhledávání: '"Czyzowicz, J."'
Autor:
Czyzowicz, J., Dobrev, S., Killick, R., Kranakis, E., Krizanc, D., Narayanan, L., Opatrny, J., Pankratov, D., Shende, S.
We consider the problem of collective exploration of a known $n$-node edge-weighted graph by $k$ mobile agents that have limited energy but are capable of energy transfers. The agents are initially placed at an arbitrary subset of nodes in the graph,
Externí odkaz:
http://arxiv.org/abs/2102.13062
Autor:
Czyzowicz, J., Georgiou, K., Killick, R., Kranakis, E., Krizanc, D., Narayanan, L., Opatrny, J., Shende, S.
We introduce and study a new search-type problem with ($n+1$)-robots on a disk. The searchers (robots) all start from the center of the disk, have unit speed, and can communicate wirelessly. The goal is for a distinguished robot (the queen) to reach
Externí odkaz:
http://arxiv.org/abs/1805.03568
Publikováno v:
In Discrete Applied Mathematics 15 October 2020 285:650-662
Cooperation between mobile robots and wireless sensor networks is a line of research that is currently attracting a lot of attention. In this context, we study the following problem of barrier coverage by stationary wireless sensors that are assisted
Externí odkaz:
http://arxiv.org/abs/1410.6726
Autor:
Czyzowicz, J., Dobrev, S., Gasieniec, L., Ilcinkas, D., Jansson, J., Klasing, R., Lignos, I., Martin, R., Sadakane, K., Sung, W. -K.
We consider the problem of periodic graph exploration in which a mobile entity with constant memory, an agent, has to visit all n nodes of an arbitrary undirected graph G in a periodic manner. Graphs are supposed to be anonymous, that is, nodes are u
Externí odkaz:
http://arxiv.org/abs/0905.1737
Publikováno v:
Discrete Mathematics & Theoretical Computer Science (DMTCS). 2020, Vol. 22 Issue 4, p1-22. 22p.
Autor:
Czyzowicz, J., Dobrev, S., González-Aguilar, H., Kralovic, R., Kranakis, E., Opatrny, J., Stacho, L., Urrutia, J.
Publikováno v:
In Theoretical Computer Science 2011 412(18):1696-1704
Publikováno v:
In Theoretical Computer Science 2009 410(14):1388-1400
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Czyzowicz, J.1, Dobrev, S.2, Joeris, B.3, Kranakis, E.4, Krizanc, D.5, Maňuch, J.6, Morales-Ponce, O.7 oscarmponce@gmail.com, Opatrny, J.8, Stacho, L.6, Urrutia, J.9
Publikováno v:
Graphs & Combinatorics. Mar2015, Vol. 31 Issue 2, p393-405. 13p.