Search Results - (( developing solving _ algorithm ) OR ( java simulation optimization algorithm ))

Attribute reduction based scheduling algorithm with enhanced hybrid genetic algorithm and particle swarm optimization for optimal device selection by Nwogbaga, Nweso Emmanuel, Latip, Rohaya, Affendey, Lilly Suriani, Abdul Rahiman, Amir Rizaan

“…The simulation is implemented with iFogSim and java programming language. …”
Get full text
Get full text

Enhancement of Ant Colony Optimization for Grid Job Scheduling and Load Balancing by Husna, Jamal Abdul Nasir

“…Global pheromone update is performed after the completion of processing the jobs in order to reduce the pheromone value of resources. A simulation environment was developed using Java programming to test the performance of the proposed EACO algorithm against existing grid resource management algorithms such as Antz algorithm, Particle Swarm Optimization algorithm, Space Shared algorithm and Time Shared algorithm, in terms of processing time and resource utilization. …”
Get full text
Get full text
Get full text

Ant colony optimization algorithm for load balancing in grid computing by Ku-Mahamud, Ku Ruhana, Mohamed Din, Aniza

“…The proposed algorithm is known as the enhance ant colony optimization (EACO). …”
Get full text
Get full text
Get full text

OPTIMIZED MIN-MIN TASK SCHEDULING ALGORITHM FOR SCIENTIFIC WORKFLOWS IN A CLOUD ENVIRONMENT by Murad S.S., Badeel R., Alsandi N.S.A., Alshaaya R.F., Ahmed R.A., Muhammed A., Derahman M.

“…To achieve this, we propose a new noble mechanism called Optimized Min-Min (OMin-Min) algorithm, inspired by the Min-Min algorithm. …”

Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization by Mohammad Ata, Karimeh Ibrahim

“…This study proposes a car parking management system which applies Dijkstra’s algorithm, Ant Colony Optimization (ACO) and Binary Search Tree (BST) in structuring a guidance system for indoor parking. …”
Get full text
Get full text

Features selection for intrusion detection system using hybridize PSO-SVM by Tabaan, Alaa Abdulrahman

“…Hybridize Particle Swarm Optimization (PSO) as a searching algorithm and support vector machine (SVM) as a classifier had been implemented to cope with this problem. …”
Get full text
Get full text

Resource management in grid computing using ant colony optimization by Ku-Mahamud, Ku Ruhana, Mohamed Din, Aniza

“…Resources with high pheromone value are selected to process the submitted jobs.Global pheromone update is performed after completion processing the jobs in order to reduce the pheromone value of resources.A simulation environment was developed using Java programming to test the performance of the proposed EACO algorithm against other ant based algorithm, in terms of resource utilization.Experimental results show that EACO produced better grid resource management solution.…”
Get full text
Get full text
Get full text
Get full text

Implementation of locust inspired scheduling algorithm with huge number of servers for energy efficiency in a cloud datacenter by Azhar, Nur Huwaina

“…Cloudsim is used as Discrete Event Simulation tool and Java as coding language to evaluate LACE algorithm. …”
Get full text
Get full text

Bats echolocation-inspired algorithms for global optimisation problems by Nafrizuan, Mat Yahya

“…The works related to swarm intelligence algorithms include the development of the algorithm itself, its modification and improvisation as well as its application in solving global optimisation problems. …”
Get full text
Get full text

Sudoku Generator based on hybrid algorithm / Faridah Abdul Rahman by Abdul Rahman, Faridah

“…The hybrid algorithm is applied in prototype development where in process on solving Sudoku. …”
Get full text
Get full text

Approximate maximum clique algorithm (AMCA): A clever technique for solving the maximum clique problem through near optimal algorithm for minimum vertex cover problem by Fayaz, Muhammad, Arshad,, Shakeel, Shah,, Abdul Salam, Shah, Asadullah

“…Background and Objective: The process of solving the Maximum Clique (MC) problem through approximation algorithms is harder, however, the Maximum Vertex Cover (MVC) problem can easily be solved using approximation algorithms. …”
Get full text
Get full text
Get full text
Get full text

Solving transcendental equation using genetic algorithm / Masitah Hambari by Masitah , Hambari

“…This project studies the potential of using Genetic Algorithm and develops a program in order to solve Transcendental Equation in optimizing problem domain. …”
Get full text
Get full text

CSC126 - Fundamentals of Algorithms and Computer Problem Solving / Faculty of Computer And Mathematical Sciences by UiTM, Faculty of Computer And Mathematical Sciences

“…In the end they are expected to develop the ability to analyze simple problems, organize effective algorithmic solutions for the problems and write computer programs to solve them.…”
Get full text
Get full text
Get full text

SG-PBFS : Shortest Gap-Priority Based Fair Scheduling technique for job scheduling in cloud environment by Murad, Saydul Akbar, Zafril Rizal, M. Azmi, Muzahid, Abu Jafar Md, Bhuiyan, Md Khairul Bashar, Saib, Md, Rahimi, Nick, Prottasha, Nusrat Jahan, Bairagi, Anupam Kumar

“…To conduct this experiment, we employed the CloudSim simulator, which is implemented using the Java programming language.…”
Get full text
Get full text
Get full text
Get full text

Simulated Kalman Filter algorithms for solving optimization problems by Nor Hidayati, Abdul Aziz

“…Its optimality has inspired the development of a metaheuristic algorithm called Heuristic Kalman Algorithm (HKA) in 2009. …”
Get full text
Get full text

New Generalized Algorithm for Developing k-Step Higher Derivative Block Methods for Solving Higher Order Ordinary Differential Equations by Adeyeye, Oluwaseun, Omar, Zurni

“…This article presents a new generalized algorithm for developing k-step (m+1) derivative block methods for solving mth order ordinary differential equations. …”
Get full text
Get full text
Get full text

Mathematical models and optimization algorithms for low-carbon Location-Inventory-Routing Problem with uncertainty by Liu, Lihua

“…Given the NP-Hard nature of the three models proposed in this thesis, two metaheuristic algorithms have been developed. A hybrid Particle Swarm Optimization-Bacterial Foraging Algorithm is developed for solving the single objective LIRP model. …”
Get full text
Get full text
Get full text

Comparison Between Genetic Algorithm and Electromagnetism-Like Algorithm for Solving Inverse Kinematics by Yap, David F. W.

“…A comparison study between Electromagnetism-Like Algorithm (EM) and Genetic Algorithm (GA)has been presented in this work to solve the Inverse Kinematics (IK) of a four-link planar robot manipulator. …”
Get full text
Get full text

Development of cell formation algorithm and model for cellular manufacturing system by Nouri, Hossein

“…In addition, one of the main challenges has been development of efficient algorithm for solving aforementioned model to find exact feasible optimal solution. …”
Get full text
Get full text

Fast Finite Difference Time Domain Algorithms for Solving Antenna Application Problem by Hasan, Mohammad Khatim

“…Existing method, known as FDTD needs a very long processing time to solve this problem. The objective of the thesis is to develop new sequential and parallel algorithms that are faster than the standard Finite Difference Time Domain method. …”
Get full text
Get full text