Results 41 to 50 of about 43,512 (302)
A new efficient RLF-like algorithm for the vertex coloring problem [PDF]
The Recursive Largest First (RLF) algorithm is one of the most popular greedy heuristics for the vertex coloring problem. It sequentially builds color classes on the basis of greedy choices.
Adegbindin Mourchid +2 more
doaj +1 more source
Domination Analysis of Greedy Heuristics For The Frequency Assignment Problem
We introduce the greedy expectation algorithm for the fixed spectrum version of the frequency assignment problem. This algorithm was previously studied for the travelling salesman problem.
Noble, SD +6 more
core +1 more source
Procedures of the greedy algorithm.
Procedures of the greedy algorithm.
Guo Ming (14559696)
core +1 more source
Greedy Firefly Algorithm for Optimizing Job Scheduling in IoT Grid Computing
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
Greedy, A-Star, and Dijkstra’s Algorithms in Finding Shortest Path
The problem of finding the shortest path from a path or graph has been quite widely discussed. There are also many algorithms that are the solution to this problem.
Syahputra, Dinur +2 more
core +1 more source
Parallel search strategies for TSPs using a greedy genetic algorithm
Traditional genetic algorithms often meet the occurrence of slow convergence and enclosure competition. We present a parallel algorithm for the traveling salesman problem (TSP) which incorporates several greedy heuristics based on genetic algorithms.
Yingzi Wei +5 more
core +1 more source
Greedy scheduling with feedback control for overloaded real-time systems [PDF]
In real-time systems, a task is required to be completed before its deadline. When workload is heavy, the system may become overloaded. Under such condition, some tasks may miss their deadlines.
Lim, Azman Osman +7 more
core +1 more source
The weighted property (A) and the greedy algorithm
We investigate various aspects of the "weighted" greedy algorithm with respect to a Schauder basis. For a weight w, we describe w-greedy, w-almost-greedy and w-partially-greedy bases, and show some properties of w-semi-greedy bases. To achieve these goals, we introduce and study the w-Property (A).
Pablo M. Berná +4 more
openaire +3 more sources
<p>This data repository includes the input and output for the results presented in K.Y. Spencer, P.V. Tsvetkov, and J.J. Jarrell, "A Greedy Memetic Algorithm for a Multiobjective Dynamic Bin Packing Problem for Storing Cooling Objects," Journal of ...
Kristy Yancey Spencer
core +1 more source
Greedy algorithms: a review and open problems
Greedy algorithms are a fundamental class of mathematics and computer science algorithms, defined by their iterative approach of making locally optimal decisions to approximate global optima. In this review, we focus on two greedy algorithms.
Andrea García
doaj +1 more source

