Search Results - (( initial solution ((a algorithm) OR (new algorithm)) ) OR ( java application using algorithm ))
Search alternatives:
- initial solution »
- java application »
- using algorithm »
- new algorithm »
- a algorithm »
-
1
Ant colony optimization algorithm for load balancing in grid computing
Published 2012“…The algorithm consists of three new mechanisms that organize the work of an ant colony i.e. initial pheromone value mechanism, resource selection mechanism and pheromone update mechanism. …”
Get full text
Get full text
Get full text
Monograph -
2
Enhancement of Ant Colony Optimization for Grid Job Scheduling and Load Balancing
Published 2011“…Experimental results show that EACO produced better grid resource management solution compared to other algorithms. …”
Get full text
Get full text
Get full text
Thesis -
3
Resource management in grid computing using ant colony optimization
Published 2011“…Managing resources in grid computing system is complicated due to the distributed and heterogeneous nature of the resources.Stagnation in grid computing system may occur when all jobs require or are assigned to the same resources which lead to the resources having high workload or the time taken to process a job is high.This research proposes an Enhanced Ant Colony Optimization (EACO) algorithm that caters dynamic scheduling and load balancing in the grid computing system.The algorithm consists of three new mechanisms that organize the work of an ant colony i.e. initial pheromone value mechanism, resource selection mechanism and pheromone update mechanism.The resource allocation problem is modeled as a graph that can be used by the ant to deliver its pheromone.This graph consists of four types of vertices which are job, requirement, resource and capacity that are used in constructing the grid resource management element.The proposed EACO algorithm takes into consideration the capacity of resources and the characteristics of jobs in determining the best resource to process a job.EACO selects the resources based on the pheromone value on each resource which is recorded in a matrix form.The initial pheromone value of each resource for each job is calculated based on the estimated transmission time and execution time of a given job. …”
Get full text
Get full text
Get full text
Get full text
Monograph -
4
Batch mode heuristic approaches for efficient task scheduling in grid computing system
Published 2016“…We simulate our proposed algorithms using a Java based simulator that is purposedly built for Grid computing simulations. …”
Get full text
Get full text
Get full text
Thesis -
5
Multistage optimal homotopy asymptotic method for solving initial-value problems
Published 2016“…In this paper, a new approximate analytical algorithm namely multistage optimal homotopy asymptotic method (MOHAM) is presented for the first time to obtain approximate analytical solutions for linear, nonlinear and system of initial value problems (IVPs).This algorithm depends on the standard optimal homotopy asymptotic method (OHAM), in which it is treated as an algorithm in a sequence of subinterval. …”
Get full text
Get full text
Get full text
Article -
6
Audio Streaming System Using Real-Time Transport Protocol Based on Java Media Framework
Published 2004“…A design proposal was outlined to provide an adaptive client/server approach to stream audio contents using Real-Time Transport Protocol (RTP) involving architecture based on the Java Media Framework (JMF) Application Programmable Interfaces (API).RTP protocol is the Internet-standard protocol for the transport of real-time data, including audio and video and can be implemented by using Java Media Framework (JMF). …”
Get full text
Get full text
Thesis -
7
Hybrid tabu search – strawberry algorithm for multidimensional knapsack problem
Published 2022“…In 2011, a new metaheuristic known as Strawberry algorithm (SBA) was initiated. …”
Get full text
Get full text
Get full text
Thesis -
8
An Educational Tool Aimed at Learning Metaheuristics
Published 2020“…This tool can be an educational assistant for beginners to learn metaheuristic in theoretical lectures as well as practical sessions. Implemented with Java, this tool provides a friendly GUI for setting the parameters and display the result from where the learner can see how the selected algorithm converges for a particular problem solution. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
9
Enhanced Harris's Hawk algorithm for continuous multi-objective optimization problems
Published 2020“…The algorithm includes (i) a population update strategy which improves the movement of hawks in the search space, (ii) a parameter adjusting strategy to control the transition between exploration and exploitation, and (iii) a population generating method in producing the initial candidate solutions. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
10
A new variant of black hole algorithm based on multi population and levy flight for clustering problem
Published 2020“…Black Hole (BH) optimization algorithm has been underlined as a solution for data clustering problems. …”
Get full text
Get full text
Thesis -
11
Optimizing S-box generation based on the Adaptive Agent Heroes and Cowards Algorithm
Published 2021“…This paper introduces a new variant of a metaheuristic algorithm based on Agent Heroes and Cowards Algorithm (AHC), called Adaptive Agent Heroes and Cowards Algorithm (AAHC). …”
Get full text
Get full text
Get full text
Article -
12
Solving ump examination timetabling problem using dynamic exploration step counting hill climbing algorithm
Published 2022“…Then, the initial solution is improved using our enhanced algorithm called dynamic exploration step counting hill climbing (DESCHC). …”
Get full text
Get full text
Thesis -
13
Hybrid genetic algorithm for uncapacitated university examination timetabling problem
Published 2015“…The main components of the genetic operators in a Genetic Algorithm (GA) will be tested and the best combination of the genetic operators will be adopted to construct a Pure Genetic Algorithm (PGA). …”
Get full text
Get full text
Thesis -
14
Comparison between Newton’s Method and a new Scaling Newton Method / Ramizah Baharuddin
Published 2021“…Newton's Method also called the Newton-Raphson method is a recursive algorithm for approximating the root of a differentiable function. …”
Get full text
Get full text
Thesis -
15
Studying the Impact of Initialization for Population-Based Algorithms with Low-Discrepancy Sequences
Published 2021“…These algorithms can affect convergence to identify a robust optimum solution. …”
Get full text
Get full text
Get full text
Get full text
Get full text
Article -
16
Enhanced grey wolf optimisation algorithm for feature selection in anomaly detection
Published 2022“…The second modification develops a new position update mechanism using the Bat Algorithm movement. …”
Get full text
Get full text
Thesis -
17
-
18
Automatic selection of initial points for exploratory vessel tracing in fluoroscopic images
Published 2011“…This paper presents a new method for efficient selection of initial points for exploratory tracing algorithms. …”
Get full text
Get full text
Get full text
Article -
19
Parameter-Less Simulated Kalman Filter
Published 2017“…Simulated Kalman Filter (SKF) algorithm is a new population-based metaheuristic optimization algorithm. …”
Get full text
Get full text
Get full text
Article -
20
Cuckoo search algorithm and wind driven optimization based study of satellite image segmentation for multilevel thresholding using Kapur’s entropy
Published 2014“…This algorithm is used to obtain the best solution or best fitness value from the initial random threshold values, and to evaluate the quality of a solution, correlation function is used. …”
Get full text
Get full text
Article
