|
|
|
|
|
Konstantin Gaipov, Daniil Tausnev, Sergey Khodenkov, Natalya Shepeta, Dmitry Malyshev, Aleksey Popov and Lev Kazakovtsev
Rapid growth in the volume of transmitted information has lead to the emergence of new wireless networking technologies with variable heterogeneous topologies. With limited radio frequency resources, optimal routing problems arise, both at the network de...
ver más
|
|
|
|
|
|
|
|
|
|
|
Meng Bi, Xianyun Yu, Zhida Jin and Jian Xu
In this paper, we propose an Iterative Greedy-Universal Adversarial Perturbations (IGUAP) approach based on an iterative greedy algorithm to create universal adversarial perturbations for acoustic prints. A thorough, objective account of the IG-UAP metho...
ver más
|
|
|
|
|
|
|
|
|
|
|
Agostinho Agra and Jose Maria Samuco
Given a social network modelled by a graph, the goal of the influence maximization problem is to find k vertices that maximize the number of active vertices through a process of diffusion. For this diffusion, the linear threshold model is considered. A n...
ver más
|
|
|
|
|
|
|
|
|
|
|
Jie Zhang, Qiao Wang, Paul Mitchell and Hamed Ahmadi
Integrated access and backhaul (IAB) networks offer transformative benefits, primarily their deployment flexibility in locations where fixed backhaul faces logistical or financial challenges. This flexibility is further enhanced by IAB?s inherent ability...
ver más
|
|
|
|
|
|
|
|
|
|
|
Esra?a Alkafaween, Ahmad Hassanat, Ehab Essa and Samir Elmougy
The genetic algorithm (GA) is a well-known metaheuristic approach for dealing with complex problems with a wide search space. In genetic algorithms (GAs), the quality of individuals in the initial population is important in determining the final optimal ...
ver más
|
|
|
|
|
|
|
|
|
|
|
Kimoon Lee, Dongjin Kim, Daewon Chung and Seonho Lee
This study explores optimizing Synthetic Aperture Radar (SAR) satellite constellation scheduling for multi-imaging missions in densely targeted areas using an in-house-developed Modified Dynamic Programming (MDP) algorithm. By employing Mixed-Integer Lin...
ver más
|
|
|
|
|
|
|
|
|
|
|
Daniel S. Soper
Training and evaluating the performance of many competing Artificial Intelligence (AI)/Machine Learning (ML) models can be very time-consuming and expensive. Furthermore, the costs associated with this hyperparameter optimization task grow exponentially ...
ver más
|
|
|
|
|
|
|
|
|
|
|
Jiaqi Wang, Bruce Golden and Carmine Cerrone
The carousel greedy algorithm (CG) was proposed several years ago as a generalized greedy algorithm. In this paper, we implement CG to solve linear regression problems with a cardinality constraint on the number of features. More specifically, we introdu...
ver más
|
|
|
|
|
|
|
|
|
|
|
Tommaso Adamo, Gianpaolo Ghiani, Emanuela Guerriero and Deborah Pareo
In this paper we exploit concepts from Information Theory to improve the classical Chvatal greedy algorithm for the set covering problem. In particular, we develop a new greedy procedure, called Surprisal-Based Greedy Heuristic (SBH), incorporating the c...
ver más
|
|
|
|
|
|
|
|
|
|
|
Mario Michelessa, Christophe Hurter, Brian Y. Lim, Jamie Ng Suat Ling, Bogdan Cautis and Carol Anne Hargreaves
Social networks have become important objects of study in recent years. Social media marketing has, for example, greatly benefited from the vast literature developed in the past two decades. The study of social networks has taken advantage of recent adva...
ver más
|
|
|
|
|
|