Zobrazeno 1 - 10
of 20
pro vyhledávání: '"Swamy, Vasuki Narasimha"'
Connection Management xAPP for O-RAN RIC: A Graph Neural Network and Reinforcement Learning Approach
Autor:
Orhan, Oner, Swamy, Vasuki Narasimha, Tetzlaff, Thomas, Nassar, Marcel, Nikopour, Hosein, Talwar, Shilpa
Connection management is an important problem for any wireless network to ensure smooth and well-balanced operation throughout. Traditional methods for connection management (specifically user-cell association) consider sub-optimal and greedy solutio
Externí odkaz:
http://arxiv.org/abs/2110.07525
Interactive, immersive and critical applications demand ultra-reliable low-latency communication (URLLC). To build wireless communication systems that can support these applications, understanding the characteristics of the wireless medium is paramou
Externí odkaz:
http://arxiv.org/abs/1806.08777
Real-time applications require latencies on the order of a millisecond with very high reliabilities, paralleling the requirements for high-performance industrial control. Current wireless technologies like WiFi, Bluetooth, LTE, etc. are unable to mee
Externí odkaz:
http://arxiv.org/abs/1803.05143
Autor:
Balaji, Bharathan, Campbell, Brad, Levy, Amit, Li, Xiaozhou, Mayberry, Addison, Roy, Nirupam, Swamy, Vasuki Narasimha, Yang, Longqi, Bahl, Victor, Chandra, Ranveer, Mahajan, Ratul
Internet of Things (IoT) promises to bring ease of monitoring, better efficiency and innovative services across many domains with connected devices around us. With information from critical parts of infrastructure and powerful cloud-based data analyt
Externí odkaz:
http://arxiv.org/abs/1701.01894
Autor:
Swamy, Vasuki Narasimha, Suri, Sahaana, Rigge, Paul, Weiner, Matthew, Ranade, Gireeja, Sahai, Anant, Nikolic, Borivoje
High-performance industrial automation systems rely on tens of simultaneously active sensors and actuators and have stringent communication latency and reliability requirements. Current wireless technologies like WiFi, Bluetooth, and LTE are unable t
Externí odkaz:
http://arxiv.org/abs/1609.02968
Publikováno v:
IEEE Transactions on Information Theory, vol. 61, no. 10, pp. 5670-5689, October 2015
Consider two remote nodes having binary sequences $X$ and $Y$, respectively. $Y$ is an edited version of ${X}$, where the editing involves random deletions, insertions, and substitutions, possibly in bursts. The goal is for the node with $Y$ to recon
Externí odkaz:
http://arxiv.org/abs/1310.2026
We consider allcast and multicast flow problems where either all of the nodes or only a subset of the nodes may be in session. Traffic from each node in the session has to be sent to every other node in the session. If the session does not consist of
Externí odkaz:
http://arxiv.org/abs/1210.3187
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.
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.
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.