Search Results - (( evolution optimization path algorithm ) OR ( data application scheduling algorithm ))
Search alternatives:
- evolution optimization »
- application scheduling »
- optimization path »
- data application »
- path algorithm »
-
1
The Development Of A Robust Algorithm For Uav Path Planning In 3d Environment
Published 2016“…Significant research has been conducted on Unmanned Aerial Vehicle (UAV) path planning using evolutionary algorithms, such as Particle Swarm Optimization (PSO), Genetic Algorithm (GA), Differential Evolution (DE), and Biogeographic-Based Optimization (BBO). …”
Get full text
Get full text
Thesis -
2
Backhaul load and performance optimality of partial joint processing schemes in LTE-A networks
Published 2014“…COMP techniques are divided into Coordinated Scheduling / Beamforming and Joint Processing. This thesis focuses on downlink joint processing, where each user receives data from various transmission points, improving the signal strength and cancelling interference. …”
Get full text
Get full text
Thesis -
3
Development of an improved GWO algorithm for solving optimal paths in complex vertical farms with multi-robot multi-tasking
Published 2024“…The EPDE-GWO algorithm is compared with Genetic Algorithm (GA), Simulated Annealing (SA), Dung Beetle Optimizer (DBO), and Particle Swarm Optimization (PSO). …”
Get full text
Get full text
Get full text
Article -
4
-
5
Finding minimum path by using Genetic Algorithm (GA)/ Siti Zuraifah Hashim
Published 2007“…Roadways and telephone systems are the examples of them. Genetic Algorithms (GA), pioneered by John Holland, applies the principle of evolution found in nature to the problem of finding an optimal solution. …”
Get full text
Get full text
Thesis -
6
Differential evolution optimization for constrained routing in Wireless Mesh Networks
Published 2014“…This solution addresses efficient and optimal routing path construction for cost and quality metrics of the application. …”
Get full text
Get full text
Get full text
Proceeding Paper -
7
Literature Review of Optimization Techniques for Chatter Suppression In Machining
Published 2011“…Various algorithms can be applied in the optimization of machining problems; however, Differential Evolution is the most appropriate for use in chatter suppression, being less time consuming, locally optimal, and more robust than both Genetic Algorithms, despite their wide applications, and Sequential Quadratic Programming, which is a famous conventional algorithm.…”
Get full text
Get full text
Get full text
Article -
8
Development of heuristic task scheduling algorithm in cloud computing
Published 2016“…To this direction, in this paper we make a summary of some scheduling algorithms and propose an Enhanced Greedy Heuristic Scheduling Algorithm (EGHSA) for task scheduling adapted for big data applications. …”
Get full text
Get full text
Proceeding Paper -
9
-
10
Comparative analysis of spiral dynamic algorithm and artificial bee colony optimization for position control of flexible link manipulators
Published 2024“…By integrating the ABC algorithm into the manipulator's control system, the goal is to enhance its ability to plan paths and optimize trajectories. …”
Get full text
Get full text
Get full text
Article -
11
Two objectives big data task scheduling using swarm intelligence in cloud computing
Published 2016“…However, these scheduling algorithms vary in term of their performance and most of these traditional and simple scheduling algorithms may not be efficient for large scale data. …”
Get full text
Get full text
Get full text
Article -
12
Simulated annealing algorithm for scheduling divisible load in large scale data grids.
Published 2009“…This paper proposes a novel Simulated Annealing (SA) algorithm for scheduling divisible load in large scale data grids. …”
Get full text
Get full text
Article -
13
Improved genetic algorithm for scheduling divisible data grid application
Published 2007“…In this paper, we exploit this property and propose an Improved Genetic Algorithm (IGA) for scheduling divisible data grid applications. …”
Get full text
Get full text
Conference or Workshop Item -
14
-
15
Simulated annealing algorithm for scheduling divisible load in large scale data grids
Published 2008“…This paper proposes a novel simulated annealing (SA) algorithm for scheduling divisible load in large scale data grids. …”
Get full text
Get full text
Conference or Workshop Item -
16
MapReduce scheduling algorithms: a review
Published 2020“…Scheduling plays an important role in big data, mainly in reducing the execution time and cost of processing. …”
Get full text
Get full text
Get full text
Get full text
Article -
17
MapReduce scheduling algorithms: a review
Published 2018“…Scheduling plays an important role in big data, mainly in reducing the execution time and cost of processing. …”
Get full text
Get full text
Get full text
Article -
18
A novel scheduling algorithm based on game theory and multicriteria decision making in LTE network
Published 2015“…The novel algorithm has proven to be an effective scheduling technique for smart grid applications.…”
Get full text
Get full text
Get full text
Article -
19
-
20
Survey on job scheduling mechanisms in grid environment
Published 2015“…Grid systems provide geographically distributed resources for both computational intensive and data-intensive applications.These applications generate large data sets.However, the high latency imposed by the underlying technologies; upon which the grid system is built (such as the Internet and WWW), induced impediment in the effective access to such huge and widely distributed data.To minimize this impediment, jobs need to be scheduled across grid environments to achieve efficient data access.Scheduling multiple data requests submitted by grid users onto the grid environment is NP-hard.Thus, there is no best scheduling algorithm that cuts across all grids computing environments.Job scheduling is one of the key research area in grid computing.In the recent past many researchers have proposed different mechanisms to help scheduling of user jobs in grid systems.Some characteristic features of the grid components; such as machines types and nature of jobs at hand means that a choice needs to be made for an appropriate scheduling algorithm to march a given grid environment.The aim of scheduling is to achieve maximum possible system throughput and to match the application needs with the available computing resources.This paper is motivated by the need to explore the various job scheduling techniques alongside their area of implementation.The paper will systematically analyze the strengths and weaknesses of some selected approaches in the area of grid jobs scheduling.This helps researchers better understand the concept of scheduling, and can contribute in developing more efficient and practical scheduling algorithms.This will also benefit interested researchers to carry out further work in this dynamic research area.…”
Get full text
Get full text
Get full text
Article
