Zobrazeno 1 - 10
of 20
pro vyhledávání: '"Vaezi, Arash"'
Autor:
Vaezi, Arash, Movaghar, Ali, Ghodsi, Mohammad, Kazemi, Seyed Mohammad Hussein, Noghrehy, Negin Bagheri, Kazemi, Seyed Mohsen
Scientists have demonstrated that quantum computing has presented novel approaches to address computational challenges, each varying in complexity. Adapting problem-solving strategies is crucial to harness the full potential of quantum computing. Non
Externí odkaz:
http://arxiv.org/abs/2312.14075
Autor:
Vaezi, Arash
This paper introduces a new concept. We intend to give life to a software agent. A software agent is a computer program that acts on a user's behalf. We put a DNA inside the agent. DNA is a simple text, a whole roadmap of a network of agents or a sys
Externí odkaz:
http://arxiv.org/abs/2211.17104
Consider two entities with constant but not necessarily equal velocities, moving on two given piece-wise linear trajectories inside a simple polygon $P$. The Trajectory Range Visibility problem deals with determining the sub-trajectories on which two
Externí odkaz:
http://arxiv.org/abs/2209.04013
Autor:
Vaezi, Arash, Daneshgar, Amir
We introduce $LoR$, a secure, fully decentralized, and distributed cooperative system, where $LoR$ stands for "the Loop of the Rings". Distinct from conventional transaction-oriented systems, $LoR$ prioritizes {\it cooperation} using its ring-based s
Externí odkaz:
http://arxiv.org/abs/2206.01121
Autor:
Vaezi, Arash, Ghodsi, Mohammad
Given a simple polygon $\cal P$, in the Art Gallery problem the goal is to find the minimum number of guards needed to cover the entire $\cal P$, where a guard is a point and can see another point $q$ when $\overline{pq}$ does not cross the edges of
Externí odkaz:
http://arxiv.org/abs/2112.01104
Given a simple polygon $\cal P$, in the Art Gallery problem, the goal is to find the minimum number of guards needed to cover the entire $\cal P$, where a guard is a point and can see another point $q$ when $\overline{pq}$ does not cross the edges of
Externí odkaz:
http://arxiv.org/abs/2108.10940
This paper studies a variant of the Art Gallery problem in which the ``walls" can be replaced by \emph{reflecting edges}, which allows the guards to see further and thereby see a larger portion of the gallery. Given a simple polygon $\cal P$, first,
Externí odkaz:
http://arxiv.org/abs/2011.03107
Autor:
Vaezi, Arash, Ghodsi, Mohammad
We consider extending the visibility polygon of a given point $q$, inside a simple polygon $P$ by converting some edges of $P$ to mirrors. We will show that several variations of the problem of finding mirror-edges to add precisely $k$ units of area
Externí odkaz:
http://arxiv.org/abs/1811.07649
We consider extending visibility polygon $(VP)$ of a given point $q$ $(VP(q))$, inside a simple polygon $\P$ by converting some edges of $\P$ to mirrors. We will show that several variations of the problem of finding mirror-edges to add at least $k$
Externí odkaz:
http://arxiv.org/abs/1707.09504
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.