Search Results - (( development through problem 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

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

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

“…The superior performances of the developed bats echolocation-inspired algorithms are verified through rigorous tests with optimisation benchmark test functions and problems. …”
Get full text
Get full text

Improved Bat Algorithm for faster convergence in solving optimisation problem by Ramli, Mohamad Raziff

“…Finally, the developed IBA is found consistent with the exact method which is the simplex method when tested through fairness nurse scheduling problem. …”
Get full text
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

Integrated optimal control and parameter estimation algorithms for discrete-time nonlinear stochastic dynamical systems by Kek, Sie Long

“…The algorithm developed in this thesis contains three sub-algorithms. …”
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

Using Metaheuristics Algorithms (MHAs) to Optimize Water Supply Operation in Reservoirs: a Review by Almubaidin M.A.A., Ahmed A.N., Sidek L.B.M., Elshafie A.

Genetic-local hybrid optimizer for solving advance layout problem by Taha, Imad, Ibrahim Habra, Hind Saleem

“…Results show the potentiality of the proposed algorithm in solving the problem and outperforming previous algorithms.…”
Get full text
Get full text
Get full text

Developing computational thinking competencies through constructivist argumentation learning: a problem-solving perspective by Voon, Xin Pei, Wong, Su Luan, Wong, Lung Hsiang, Md Khambari, Mas Nida, Syed Abdullah, Sharifah Intan Sharina

“…To nurture higher order thinking skills and to engage effective problem-solvers, our framework incorporates four Computational Thinking-Argumentation design principles to support instructional innovation in the teaching and learning of science at the secondary school level, viz. 1) developing problem-solving competencies and building capability in solving uncertainties throughout scientific inquiry; 2) developing creative thinking and cooperativity through negotiation and evaluation; 3) developing algorithmic thinking in talking and writing; 4) developing critical thinking in the processes of abstraction and generalization.…”
Get full text
Get full text

Efficient Sequential and Parallel Routing Algorithms in Optical Multistage Interconnection Network by Abduh Kaid, Monir Abdullah

“…This routing problem is an NPhard problem. Many algorithms are designed by many researchers to perform this routing such as window method, sequential algorithm, degree-descending algorithm, simulated annealing algorithm, genetic algorithm and ant colony algorithm.This thesis explores two approaches, sequential and parallel approaches. …”
Get full text
Get full text

Overview of metaheuristic: classification of population and trajectory by Zainul Rashid, Zarina

“…Some algorithms can be defined if the developer of the system has problem specific knowledge to the solution. …”
Get full text
Get full text

Augmentation of basic-line-search and quick-simplex-method algorithms to enhance linear programming computational performance by Nor Azlan, Nor Asmaa Alyaa

“…Finally, mathematical experimentation is proceeded concerning on verification and validation of the new algorithm. The verification performed through generated random problems via MATLAB has shown the new augmentation algorithm maintains to generate a lesser iteration number from the highest percentage of nonzero coefficients in constraints matrix (80%) and the biggest problem sizes (m = 100, n = 100) until to the lowest percentage of nonzero coefficients in constraints matrix (20%) and the smallest problem sizes (m = 5, n = 5). …”
Get full text
Get full text
Get full text