Zobrazeno 1 - 10
of 777
pro vyhledávání: '"Madhu, N."'
In a network consisting of n nodes, our goal is to identify the most central k nodes with respect to the proposed definitions of centrality. Depending on the specific application, there exist several metrics for quantifying k-centrality, and the subs
Externí odkaz:
http://arxiv.org/abs/2406.05512
Algebraic connectivity is one way to quantify graph connectivity, which in turn gauges robustness as a network. In this paper, we consider the problem of maximising algebraic connectivity both local and globally over all simple, undirected, unweighte
Externí odkaz:
http://arxiv.org/abs/2110.01918
Autor:
Kumar, Sandeep, Belur, Madhu N.
SISO passive systems with just one type of memory/storage element (either only inductive or only capacitative) are known to have real poles and zeros, and further, with the zeros interlacing poles (ZIP). Due to a variety of definitions of the notion
Externí odkaz:
http://arxiv.org/abs/2007.13599
In this paper, we study structural controllability of a linear time invariant (LTI) composite system consisting of several subsystems. We assume that the neighbourhood of each subsystem is unconstrained, i.e., any subsystem can interact with any othe
Externí odkaz:
http://arxiv.org/abs/1711.05975
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.
Publikováno v:
In Materials Science & Engineering B October 2022 284
Autor:
Jamalaiah, B.C., Khan, P. Shahab, Madhu, N., Gawas, Pratiksha, Nutalapati, Venkatramaiah, Narayana Reddy, A. Surya, Reddy, G.V. Lokeswara
Publikováno v:
In Ceramics International 1 October 2022 48(19) Part B:28927-28934
Autor:
Shahab Khan, P., Jamalaiah, B.C., Jayasimhadri, M., Kaur, Harpreet, Madhu, N., Raghupathi, P., Pavani, K.
Publikováno v:
In Journal of Molecular Structure 5 May 2022 1255
Rapidly Mixing Markov Chain Monte Carlo Technique for Matching Problems with Global Utility Function
This paper deals with a complete bipartite matching problem with the objective of finding an optimal matching that maximizes a certain generic predefined utility function on the set of all matchings. After proving the NP-hardness of the problem using
Externí odkaz:
http://arxiv.org/abs/1710.10037