Zobrazeno 1 - 10
of 12
pro vyhledávání: '"Huda Chuangpishit"'
Publikováno v:
Information, Vol 11, Iss 11, p 506 (2020)
The problem of evacuating two robots from the disk in the face-to-face model was first introduced by Czyzowicz et al. [DISC’2014], and has been extensively studied (along with many variations) ever since with respect to worst-case analysis. We init
Externí odkaz:
https://doaj.org/article/58cb5cb4785e457f997f5787f3ae2ba0
Publikováno v:
Discrete Applied Mathematics. 284:556-571
On-line social networks, such as in Facebook and Twitter, are often studied from the perspective of friendship ties between agents in the network. Adversarial ties, however, also play an important role in the structure and function of social networks
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4b85744e5780be92afff948f526c4edd
https://doi.org/10.1016/j.dam.2020.04.018
https://doi.org/10.1016/j.dam.2020.04.018
Publikováno v:
Discrete Mathematics, Algorithms and Applications. 14
A set of mobile robots is placed at arbitrary points of an infinite line. The robots are equipped with GPS devices and they may communicate their positions on the line to a central authority. The collection contains an unknown subset of “spies”,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::52e2870a5408d18d42f898d145206806
https://doi.org/10.1142/s1793830922500306
https://doi.org/10.1142/s1793830922500306
Publikováno v:
European Journal of Combinatorics. 61:47-68
Let $w:[0,1]^2\rightarrow [0,1]$ be a symmetric function, and consider the random process $G(n,w)$, where vertices are chosen from $[0,1]$ uniformly at random, and $w$ governs the edge formation probability. Such a random graph is said to have a line
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2b94e7f9444eb04fa0f29875c56a606d
https://doi.org/10.1016/j.ejc.2016.09.004
https://doi.org/10.1016/j.ejc.2016.09.004
Publikováno v:
Algorithms for Sensor Systems ISBN: 9783030140939
ALGOSENSORS
ALGOSENSORS
The problem of evacuating two robots from the disk in the face-to-face model was first introduced in [16], and extensively studied (along with many variations) ever since with respect to worst case analysis. We initiate the study of the same problem
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::97a9f2729ff43d7c74c27d37bd0ffc26
https://doi.org/10.1007/978-3-030-14094-6_5
https://doi.org/10.1007/978-3-030-14094-6_5
Publikováno v:
Information, Vol 11, Iss 506, p 506 (2020)
The problem of evacuating two robots from the disk in the face-to-face model was first introduced by Czyzowicz et al. [DISC’2014], and has been extensively studied (along with many variations) ever since with respect to worst-case analysis. We init
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::17f06e16d9c6a45729f45b9b97d6ec63
https://doi.org/10.3390/info11110506
https://doi.org/10.3390/info11110506
Publikováno v:
Computational Geometry. 89:101624
Consider $k$ robots initially located at a point inside a region $T$. Each robot can move anywhere in $T$ independently of other robots with maximum speed one. The goal of the robots is to \emph{evacuate} $T$ through an exit at an unknown location on
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::91a72da48863e46f1532c1607834e583
https://doi.org/10.1016/j.comgeo.2020.101624
https://doi.org/10.1016/j.comgeo.2020.101624
Autor:
Leszek Gąsieniec, Konstantinos Georgiou, Tomasz Jurdzinski, Evangelos Kranakis, Jurek Czyzowicz, Huda Chuangpishit
Publikováno v:
SOFSEM
SOFSEM 2018: THEORY AND PRACTICE OF COMPUTER SCIENCE
SOFSEM 2018: Theory and Practice of Computer Science ISBN: 9783319731162
SOFSEM 2018: THEORY AND PRACTICE OF COMPUTER SCIENCE
SOFSEM 2018: Theory and Practice of Computer Science ISBN: 9783319731162
Patrolling consists of scheduling perpetual movements of a collection of mobile robots, so that each point of the environment is regularly revisited by any robot in the collection. In previous research, it was assumed that all points of the environme
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cbc709118bb409f03cc3e8202bc4bd0a
http://livrepository.liverpool.ac.uk/3009839/1/1710.00466.pdf
http://livrepository.liverpool.ac.uk/3009839/1/1710.00466.pdf
Publikováno v:
Combinatorial Optimization and Applications ISBN: 9783030046507
COCOA
COCOA
Let G be a graph where every vertex has a colour and has specified diversity constraints, that is, a minimum number of neighbours of every colour. Every vertex also has a max-degree constraint: an upper bound on the total number of neighbours. In the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::786177b7ce045db94a8b8fc0f2fe6672
https://doi.org/10.1007/978-3-030-04651-4_11
https://doi.org/10.1007/978-3-030-04651-4_11
Publikováno v:
Electronic Notes in Discrete Mathematics. 49:541-547
In a random graph with a spatial embedding, the probability of linking to a particular vertex v decreases with distance, but the rate of decrease may depend on the particular vertex v, and on the direction in which the distance increases. In this art
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8c11f1906baa35bfb3cde52e85865d9b
https://doi.org/10.1016/j.endm.2015.06.074
https://doi.org/10.1016/j.endm.2015.06.074