Malleable jobs have the particularity that the number of allocated servers can be changed during runtime. We present an energy-aware greedy algorithm with Particle Swarm Optimised parameters as a possible solut
We give aparameterized algorithm GREEDY α that belongs to the class of "myopic" algorithms, which are deterministic algorithms that process the given intervals in order of non-decreasing right endpoint and can either reject or select each interval (rejections are irrevocable). We show that there ...
This is one of the reasons why the algorithm converges prematurely. Due to the widespread use of greedy selection methods, the survivor selection method defined in step 3 is one of the least studied topics in the design of MHS algorithms. Based on this, Hamdi Tolga Kahraman et al. improve ...
In order to enhance its performance, this paper proposes an improved flower pollination algorithm, combined with three strategies, i.e., a new double-direction learning strategy to advance the local searching ability, a new greedy strategy to strengthen the diversity of population and a new ...
consequently prolonging the network lifespan as the number of message hops from the sensor node to another to reach the base node will be decreased as a result of using Prim’s greedy algorithm [133] in finding the minimum spanning tree (MST) [134] via establishing the shortest communication...
My generator implements what's known as a greedy algorithm. This means that the algorithm makes every valid move it finds, even if not making a valid move might ultimately create a better overall result. As with many greedy algorithms, while it doesn't produce an optimal result, it produces...
It will be shown that looking at a problem from the viewpoint of matroids enables us to understand the essence of the problem as well as its relations to other problems, clearly, preventing us from probable confusion into which we might have been involve
We present an algorithm, dubbed Multi-Branch Matching Pursuit (MBMP), to solve the sparse recovery problem over redundant dictionaries. MBMP combines three different paradigms: being a greedy method, it performs iterative signal support estimation; as a rank-aware method, it is able to exploit ...
So we want to keep both the order of columns and the consecutive ones propery. In =-=[12]-=-, I couldsnd a greedy polynomial algorithm for the C1P with partial order on the columns. This algorithm reduces partial order to a total order, and then solve the problem in time O(jcj 3...
Chumburidze M, Basheleishvili I, Khetsuriani A (2019) Dynamic programming and greedy algorithm strategy for solving several classes of graph optimization problems. BRAIN. Broad Res Artif Intell Neurosci 10(1):101–107 Google Scholar Lan G (2020) First-order and stochastic optimization methods...