[HTML][HTML] A new stochastic diffusion model for influence maximization in social networks

A Rezvanian, SM Vahidipour, MR Meybodi - Scientific Reports, 2023 - nature.com
Most current studies on information diffusion in online social networks focus on the
deterministic aspects of social networks. However, the behavioral parameters of online …

[HTML][HTML] Efficiently guiding k-robots along pathways with minimal turns

H Hoorfar, N Taheri, H Kosarirad… - … Transactions on AI and …, 2023 - publications.eai.eu
INTRODUCTION: This paper addresses the navigation of a team of k protector robots within
pathways, focusing on minimizing the total number of turns. These robots utilize orthogonal …

Securing Pathways with Orthogonal Robots

H Hoorfar, F Fathi, SM Largani, A Bagheri - arXiv preprint arXiv …, 2023 - arxiv.org
The protection of pathways holds immense significance across various domains, including
urban planning, transportation, surveillance, and security. This article introduces a …

[HTML][HTML] Minimizing outbreak through targeted blocking for disease control: a community-based approach using super-spreader node identification

A Sheikhahmadi, M Bahrami, H Saremi - Scientific Reports, 2023 - nature.com
The COVID-19 pandemic has caused significant disruptions to the daily lives of individuals
worldwide, with many losing their lives to the virus. Vaccination has been identified as a …

A fast module identification and filtering approach for influence maximization problem in social networks

HA Beni, A Bouyer, S Azimi, A Rouhi, B Arasteh - Information Sciences, 2023 - Elsevier
In this paper, we explore influence maximization, one of the most widely studied problems in
social network analysis. However, developing an effective algorithm for influence …

Identifying influential nodes for influence maximization problem in social networks using an improved discrete particle swarm optimization

J Tang, H Zhu, J Lan, S Song, J Qu, Q Du - Social Network Analysis and …, 2023 - Springer
Influence maximization problem is to select a set of influential nodes and maximize the
influence spread of the seed set in the social networks. Greedy strategies are high time …

A method based on k-shell decomposition to identify influential nodes in complex networks

BR HamaKarim, RP Mohammadiani… - The Journal of …, 2023 - Springer
Identifying the most influential nodes in complex networks is an open research issue, which
can be divided into two sub-problems: identifying and ranking the influential nodes based on …

A Monte Carlo simulation approach to the gap-time relationship in solving scheduling problem

O TORAĞAY, S Pouya - Journal of Turkish Operations Management, 2023 - dergipark.org.tr
This article presents a study on the job shop problem, a combinatorial optimization problem
that models scheduling and resource allocation in industrial settings. The article aims to …

Exploiting community and structural hole spanner for influence maximization in social networks

X Li, Z Chen - Expert Systems, 2023 - Wiley Online Library
Viral marketing is a frequently used social marketing strategy which aims to promote
products on various social media. In order to devise an efficient viral marketing strategy …

A Monte Carlo simulation approach to the gap-time relationship in solving the Job Shop Scheduling Problem.

O Toragay, S Pouya - Journal of Turkish Operations …, 2023 - search.ebscohost.com
This article presents a study on the job shop problem, a combinatorial optimization problem
that models scheduling and resource allocation in industrial settings. The article aims to …