Zobrazeno 1 - 10
of 275
pro vyhledávání: '"P Gahlawat"'
The geodetic closure of a set S of vertices of a graph is the set of all vertices in shortest paths between pairs of vertices of S. A set S of vertices in a graph is geodetic if its geodetic closure contains all the vertices of the graph. Buckley int
Externí odkaz:
http://arxiv.org/abs/2409.20505
Autor:
Das, Sandip, Gahlawat, Harmender
Cops and Robber is a well-studied two-player pursuit-evasion game played on a graph, where a group of cops tries to capture the robber. The \emph{cop number} of a graph is the minimum number of cops required to capture the robber. Gaven\v{c}iak et al
Externí odkaz:
http://arxiv.org/abs/2408.11002
Publikováno v:
Biomedical and Biotechnology Research Journal, Vol 2, Iss 4, Pp 265-268 (2018)
Background: Vitamin B12 maintains normal folate metabolism during pregnancy. Maternal folate status has been associated with various adverse pregnancy outcomes. The aim of this study is to predict the risk of abortion in early pregnancy by studying t
Externí odkaz:
https://doaj.org/article/d2ae96154a5441199195244858200a54
We introduce $\mathcal{L}_1$-MBRL, a control-theoretic augmentation scheme for Model-Based Reinforcement Learning (MBRL) algorithms. Unlike model-free approaches, MBRL algorithms learn a model of the transition function using data and use it to desig
Externí odkaz:
http://arxiv.org/abs/2403.14860
Autor:
Gahlawat, Harmender, Zehavi, Meirav
\textit{Fair division} of resources among competing agents is a fundamental problem in computational social choice and economic game theory. It has been intensively studied on various kinds of items (\textit{divisible} and \textit{indivisible}) and u
Externí odkaz:
http://arxiv.org/abs/2310.01310
Hunters and Rabbit game is played on a graph $G$ where the Hunter player shoots at $k$ vertices in every round while the Rabbit player occupies an unknown vertex and, if not shot, must move to a neighbouring vertex after each round. The Rabbit player
Externí odkaz:
http://arxiv.org/abs/2309.16533
Given an undirected graph $G$ and a multiset of $k$ terminal pairs $\mathcal{X}$, the Vertex-Disjoint Paths (\VDP) and Edge-Disjoint Paths (\EDP) problems ask whether $G$ has $k$ pairwise internally vertex-disjoint paths and $k$ pairwise edge-disjoin
Externí odkaz:
http://arxiv.org/abs/2309.16892
Autor:
Gahlawat, Harmender, Zehavi, Meirav
\textit{Pursuit-evasion games} have been intensively studied for several decades due to their numerous applications in artificial intelligence, robot motion planning, database theory, distributed computing, and algorithmic theory. \textsc{Cops and Ro
Externí odkaz:
http://arxiv.org/abs/2307.04594
\textsc{Cops and Robber} is one of the most studied two-player pursuit-evasion games played on graphs, where multiple \textit{cops}, controlled by one player, pursue a single \textit{robber}. The main parameter of interest is the \textit{cop number}
Externí odkaz:
http://arxiv.org/abs/2307.00584
Autor:
Wu, Zhuohuan, Cheng, Sheng, Zhao, Pan, Gahlawat, Aditya, Ackerman, Kasey A., Lakshmanan, Arun, Yang, Chengyu, Yu, Jiahao, Hovakimyan, Naira
Quadrotors that can operate predictably in the presence of imperfect model knowledge and external disturbances are crucial in safety-critical applications. We present L1Quad, a control architecture that ensures uniformly bounded transient response of
Externí odkaz:
http://arxiv.org/abs/2302.07208