Zobrazeno 1 - 10
of 475
pro vyhledávání: '"S. Durga"'
The information flows among the people while they communicate through social media websites. Due to the dependency on digital media, a person shares important information or regular updates with friends and family. The set of persons on social media
Externí odkaz:
http://arxiv.org/abs/2406.08876
Autor:
Navaneetha Krishnan Rajagopal, Naila Iqbal Qureshi, S. Durga, Edwin Hernan Ramirez Asis, Rosario Mercedes Huerta Soto, Shashi Kant Gupta, S. Deepak
Publikováno v:
Complexity, Vol 2022 (2022)
Technological efforts are currently being used across a broad array of industries. Through the combination of consumer choice and matching principle, the goal of this paper is to investigate the prospective implications of artificial intelligence sys
Externí odkaz:
https://doaj.org/article/7b3819735d6d450b803076280fef6805
Nowadays, organizations use viral marketing strategies to promote their products through social networks. It is expensive to directly send the product promotional information to all the users in the network. In this context, Kempe et al. \cite{kempe2
Externí odkaz:
http://arxiv.org/abs/2404.08236
Given a graph $G=(V, E)$, the problem of Graph Burning is to find a sequence of nodes from $V$, called a burning sequence, to burn the whole graph. This is a discrete-step process, and at each step, an unburned vertex is selected as an agent to sprea
Externí odkaz:
http://arxiv.org/abs/2307.08505
Publikováno v:
International Journal of Electrochemistry, Vol 2014 (2014)
This paper reports the media flexibility of membraneless sodium perborate fuel cell (MLSPBFC) using acid/alkaline bipolar electrolyte in which the anode is in acidic media while the cathode is in alkaline media, or vice versa. Investigation of the ce
Externí odkaz:
https://doaj.org/article/baeceef6b74041fcb8c4702026638aaa
Given a graph $G=(V,E)$, the problem of \gb{} is to find a sequence of nodes from $V$, called burning sequence, in order to burn the whole graph. This is a discrete-step process, in each step an unburned vertex is selected as an agent to spread fire
Externí odkaz:
http://arxiv.org/abs/2204.00772
Autor:
Lakshmi, T. Jaya1 (AUTHOR) jaya.phd.hcu@gmail.com, Bhavani, S. Durga2 (AUTHOR)
Publikováno v:
Computing. Jul2024, Vol. 106 Issue 7, p2157-2183. 27p.
Autor:
Kammari, Monachary1 (AUTHOR) 19mcpc08@uohyd.ac.in, Bhavani, S. Durga1 (AUTHOR)
Publikováno v:
Computing. Jul2024, Vol. 106 Issue 7, p2239-2259. 21p.
Autor:
Lakshmi, T. Jaya, Bhavani, S. Durga
The problem of recommender system is very popular with myriad available solutions. A novel approach that uses the link prediction problem in social networks has been proposed in the literature that model the typical user-item information as a biparti
Externí odkaz:
http://arxiv.org/abs/2102.09185
In an organization, tasks called projects that require several skills, are generally assigned to teams rather than individuals. The problem of choosing a right team for a given task with minimal communication cost is known as team formation problem a
Externí odkaz:
http://arxiv.org/abs/2008.11191