Zobrazeno 1 - 10
of 80
pro vyhledávání: '"Sridharan, Arun"'
Autor:
Diggs, Colin, Doyle, Michael, Madan, Amit, Scott, Siggy, Escamilla, Emily, Zimmer, Jacob, Nekoo, Naveed, Ursino, Paul, Bartholf, Michael, Robin, Zachary, Patel, Anand, Glasz, Chris, Macke, William, Kirk, Paul, Phillips, Jasper, Sridharan, Arun, Wendt, Doug, Rosen, Scott, Naik, Nitin, Brunelle, Justin F., Thaker, Samruddhi
Legacy software systems, written in outdated languages like MUMPS and mainframe assembly, pose challenges in efficiency, maintenance, staffing, and security. While LLMs offer promise for modernizing these systems, their ability to understand legacy l
Externí odkaz:
http://arxiv.org/abs/2411.14971
Autor:
Sridharan, Arun
The coordination chemistry of nitrogenous ligands at high-spin iron is investigated through the synthesis and characterization of a terminal imido complex of a cuboidal tetra(μ3-sulfido)tetrairon (Fe4S4) cluster. Structural, spectroscopic, and compu
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.
Autor:
Beard, Jessica C., Wang, Chi-Hsien, Sridharan, Arun, Croy, Robert G., Essigmann, John M., Swager, Timothy M.
Publikováno v:
ACS Sensors; 9/27/2024, Vol. 9 Issue 9, p4655-4661, 7p
Autor:
Sridharan, Arun
Scheduling complexity is an important bottleneck in the efficient design and controlof wireless networks. Owing to the high computational complexity of throughputoptimallink schedulers, low-complexity schedulers such as Greedy Maximal Scheduling(GMS)
Externí odkaz:
http://rave.ohiolink.edu/etdc/view?acc_num=osu1366072589
Autor:
Sridharan, Arun Kumar.
Publikováno v:
May be available electronically.
Thesis (Ph. D.)--Stanford University, 2007.
Submitted to the Department of Computer Science. Copyright by the author.
Submitted to the Department of Computer Science. Copyright by the author.
Autor:
Sridharan, Arun, Koksal, C. Emre
We consider the problem of link scheduling for wireless networks with fading channels, where the link rates are varying with time. Due to the high computational complexity of the throughput optimal scheduler, we provide a low complexity greedy link s
Externí odkaz:
http://arxiv.org/abs/1203.2024
Autor:
Sridharan, Arun, Koksal, C. Emre
We consider the problem of joint link scheduling and power control for wireless networks with average transmission power constraints. Due to the high computational complexity of the optimal policies, we extend the class of greedy link scheduling poli
Externí odkaz:
http://arxiv.org/abs/1202.4033
Autor:
Kim, Youngsuk1,2 (AUTHOR), Sridharan, Arun1 (AUTHOR), Suess, Daniel L. M.1 (AUTHOR) suess@mit.edu
Publikováno v:
Angewandte Chemie. 11/21/2022, Vol. 134 Issue 47, p1-7. 7p.
A Greedy link scheduler for Wireless Networks having Gaussian Broadcast and Multiple Access Channels
Information theoretic Broadcast Channels (BC) and Multiple Access Channels (MAC) enable a single node to transmit data simultaneously to multiple nodes, and multiple nodes to transmit data simultaneously to a single node respectively. In this paper,
Externí odkaz:
http://arxiv.org/abs/1002.3229