Results 1 to 10 of about 33,532 (165)
Greedy Firefly Algorithm for Optimizing Job Scheduling in IoT Grid Computing
Sensors, 2022 The Internet of Things (IoT) is defined as interconnected digital and mechanical devices with intelligent and interactive data transmission features over a defined network.
Adil Yousif +6 more
doaj +1 more source
Finding Hierarchical Structures of Disordered Systems: An Application for Market Basket Analysis
IEEE Access, 2021 Complex systems can be characterized by their level of order or disorder. An ordered system is related to the presence of system properties that are correlated with each other.
Mauricio A. Valle, Gonzalo A. Ruz
doaj +1 more source
Multi-greedy geographic packets forwarding using flow-based indicators [PDF]
EAI Endorsed Transactions on Mobile Communications and Applications, 2021 The MANET packet routing method of geographic greedy forwarding involves the selection of distance reducing intermediate relays towards a destination.
G. Oladeji-Atanda, D. Mpoeleng, F. Ogwu
doaj +1 more source
A Surprisal-Based Greedy Heuristic for the Set Covering Problem
Algorithms, 2023 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 ...
Tommaso Adamo +3 more
doaj +1 more source
A Local PSO-Based Algorithm for Cooperative Multi-UAV Pollution Source Localization
IEEE Access, 2022 Recently, air pollution has grown significantly, and it can frequently be challenging to identify the sources of contaminants. This article studies the deployment of multi-cooperative unmanned aerial vehicles (UAVs) to look for sources of pollution in an
Hassan Saadaoui, Faissal El Bouanani
doaj +1 more source
Greedy Criterion in Orthogonal Greedy Learning [PDF]
IEEE Transactions on Cybernetics, 2018 Orthogonal greedy learning (OGL) is a stepwise learning scheme that starts with selecting a new atom from a specified dictionary via the steepest gradient descent (SGD) and then builds the estimator through orthogonal projection. In this paper, we found that SGD is not the unique greedy criterion and introduced a new greedy criterion, called as ...
Lin Xu +5 more
openaire +2 more sources
Mathematics, 2022 In this work, we seek to design a model that contributes to the study and resolution of a multi-objective rescheduling problem in dynamic permutation flow shop contexts.
Pablo Valledor +3 more
doaj +1 more source
Totally Greedy Coin Sets and Greedy Obstructions [PDF]
The Electronic Journal of Combinatorics, 2008 A coin set is a strictly increasing list of positive integers that always begins with 1. A coin set is called greedy when the simple greedy change-making algorithm always produces the fewest number of coins in change. Here, the greedy change-making algorithm repeatedly selects the largest denomination coin less than the remaining amount until it has ...
Cowen, L. J. +2 more
openaire +2 more sources
Combinatorics, Probability and Computing, 2013 We study a discrete time self-interacting random process on graphs, which we call greedy random walk. The walker is located initially at some vertex. As time evolves, each vertex maintains the set of adjacent edges touching it that have not yet been crossed by the walker.
Orenshtein T., Shinkar I.
openaire +3 more sources