Zobrazeno 1 - 10
of 669
pro vyhledávání: '"Spirakis, P."'
In this paper, we consider the problem of finding weak independent sets in a distributed network represented by a hypergraph. In this setting, each edge contains a set of r vertices rather than simply a pair, as in a standard graph. A k-weak independ
Externí odkaz:
http://arxiv.org/abs/2411.13377
Autor:
Gąsieniec, Leszek, Kuszner, Łukasz, Latif, Ehsan, Parasuraman, Ramviyas, Spirakis, Paul, Stachowiak, Grzegorz
In the distributed localization problem (DLP), n anonymous robots (agents) A0, A1, ..., A(n-1) begin at arbitrary positions p0, ..., p(n-1) in S, where S is a Euclidean space. The primary goal in DLP is for agents to reach a consensus on a unified co
Externí odkaz:
http://arxiv.org/abs/2411.08434
We consider random simple temporal graphs in which every edge of the complete graph $K_n$ appears once within the time interval [0,1] independently and uniformly at random. Our main result is a sharp threshold on the size of any maximum $\delta$-cliq
Externí odkaz:
http://arxiv.org/abs/2404.07147
In this paper, we study the complexity of the \textit{periodic temporal graph realization} problem with respect to upper bounds on the fastest path durations among its vertices. This constraint with respect to upper bounds appears naturally in transp
Externí odkaz:
http://arxiv.org/abs/2403.18513
Robots are becoming an increasingly common part of scientific work within laboratory environments. In this paper, we investigate the problem of designing \emph{schedules} for completing a set of tasks at fixed locations with multiple robots in a labo
Externí odkaz:
http://arxiv.org/abs/2402.12019
In this paper, we study the graph induced by the $\textit{2-swap}$ permutation on words with a fixed Parikh vector. A $2$-swap is defined as a pair of positions $s = (i, j)$ where the word $w$ induced by the swap $s$ on $v$ is $v[1] v[2] \dots v[i -
Externí odkaz:
http://arxiv.org/abs/2307.01648
Bayesian Decision Trees (DTs) are generally considered a more advanced and accurate model than a regular Decision Tree (DT) because they can handle complex and uncertain data. Existing work on Bayesian DTs uses Markov Chain Monte Carlo (MCMC) with an
Externí odkaz:
http://arxiv.org/abs/2305.18774
In this paper we investigate phenomena of spontaneous emergence or purposeful formation of highly organized structures in networks of related agents. We show that the formation of large organized structures requires exponentially large, in the size o
Externí odkaz:
http://arxiv.org/abs/2304.04480
We consider a contest game modelling a contest where reviews for $m$ proposals are crowdsourced from $n$ strategic agents} players. Player $i$ has a skill $s_{i\ell}$ for reviewing proposal $\ell$; for her review, she strategically chooses a quality
Externí odkaz:
http://arxiv.org/abs/2302.14701
In this paper we initiate the study of the temporal graph realization problem with respect to the fastest path durations among its vertices, while we focus on periodic temporal graphs. Given an $n \times n$ matrix $D$ and a $\Delta \in \mathbb{N}$, t
Externí odkaz:
http://arxiv.org/abs/2302.08860