Zobrazeno 1 - 10
of 397
pro vyhledávání: '"Georgiou Konstantinos"'
Autor:
Georgiou, Konstantinos, Wang, Xin
We consider \emph{weighted group search on a disk}, which is a search-type problem involving 2 mobile agents with unit-speed. The two agents start collocated and their goal is to reach a (hidden) target at an unknown location and a known distance of
Externí odkaz:
http://arxiv.org/abs/2406.19490
We present several advancements in search-type problems for fleets of mobile agents operating in two dimensions under the wireless model. Potential hidden target locations are equidistant from a central point, forming either a disk (infinite possible
Externí odkaz:
http://arxiv.org/abs/2406.19495
Autor:
Elgedawy, Ran, Sadik, John, Dutta, Senjuti, Gautam, Anuj, Georgiou, Konstantinos, Gholamrezae, Farzin, Ji, Fujiao, Lim, Kyungchan, Liu, Qian, Ruoti, Scott
$ $Large Language Models (LLMs) are being increasingly utilized in various applications, with code generations being a notable example. While previous research has shown that LLMs have the capability to generate both secure and insecure code, the lit
Externí odkaz:
http://arxiv.org/abs/2402.00689
Remote sensing images present unique challenges to image analysis due to the extensive geographic coverage, hardware limitations, and misaligned multi-scale images. This paper revisits the classical multi-scale representation learning problem but und
Externí odkaz:
http://arxiv.org/abs/2401.15855
We investigate a combinatorial optimization problem that involves patrolling the edges of an acute triangle using a unit-speed agent. The goal is to minimize the maximum (1-gap) idle time of any edge, which is defined as the time gap between consecut
Externí odkaz:
http://arxiv.org/abs/2307.13153
We consider search by mobile agents for a hidden, idle target, placed on the infinite line. Feasible solutions are agent trajectories in which all agents reach the target sooner or later. A special feature of our problem is that the agents are $p$-fa
Externí odkaz:
http://arxiv.org/abs/2303.15608
Autor:
Georgiou, Konstantinos, Jang, Woojin
The input to the \emph{Triangle Evacuation} problem is a triangle $ABC$. Given a starting point $S$ on the perimeter of the triangle, a feasible solution to the problem consists of two unit-speed trajectories of mobile agents that eventually visit ev
Externí odkaz:
http://arxiv.org/abs/2209.08544
Publikováno v:
In Theoretical Computer Science 27 October 2024 1014
Publikováno v:
In Information and Software Technology July 2024 171
The search-type problem of evacuating 2 robots in the wireless model from the (Euclidean) unit disk was first introduced and studied by Czyzowicz et al. [DISC'2014]. Since then, the problem has seen a long list of follow-up results pertaining to vari
Externí odkaz:
http://arxiv.org/abs/2108.02367