Search Results - (( course optimization _ 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. …”

Approach For Optimizing Course Recommendation Based On Integrating Modified Felder-Silverman Learning Style Model With Meta-Heuristics Algorithm by Ashraf, Erum

“…It involves identifying potential courses learning style, validated through genetic and surrogate meta-heuristics optimization algorithms, and employing Felder-Silverman model for learning style identification. …”
Get full text
Get full text

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

A Micro-Genetic Algorithm Approach for Soft Constraint Satisfaction Problem in University Course Scheduling by Abd. Halim, Bohadean @ Bohari

“…A university course timetabling problem is a combination of optimization problems. …”
Get full text
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

Optimizing invigilator's timetabling using genetic algorithm / Mursyidul Syafiq Marzuki by Marzuki, Mursyidul Syafiq

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

A harmony search algorithm for university course timetabli by Al-Betar, Mohammed Azmi, Khader, Ahamad Tajudin

“…In this paper, a harmony search and a modified harmony search algorithm are applied to university course timetabling against standard benchmarks. …”
Get full text
Get full text
Get full text

Hybridizing harmony search with local search based metaheuristic for solving curriculum based university course timetabling / Juliana Wahid by Wahid, Juliana

“…The real data of UUM CAS timetable was analyzed and processed using the proposed algorithms. The result shows that the quality cost of UUM CAS course timetabling produced by the proposed algorithms is better compared to the course timetable produced by the ready-made software package. …”
Get full text
Get full text

Performance comparison of linear and non-linear great deluge algorithms in solving university course timetabling problems by Joe Henry Obit, Yik Junn Kuan, Rayner Alfred

“…The reason may be due to the constraints involved varied for each dataset as the optimization problems solved by any algorithms are uniformed in relation to the NFL theorems.…”
Get full text
Get full text
Get full text
Get full text
Get full text

Web based personalized university timetable for UiTM students using genetic algorithm / Mohd Radhi Fauzan Jamli and Ahmad Firdaus Ahmad Fadzil by Jamli, Mohd Radhi Fauzan, Ahmad Fadzil, Ahmad Firdaus

“…The proposed approach utilizes genetic algorithms to dynamically produce optimized timetables based on individual student needs, with real-time data scraping from 'iCRESS' ensuring the system stays up to date with the latest course information for accurate timetable generation. …”
Get full text
Get full text
Get full text

Meta-Heuristic Algorithms for Learning Path Recommender at MOOC by Son, N.T., Jaafar, J., Aziz, I.A., Anh, B.N.

“…We have developed Metaheuristic algorithms includes the Genetic Algorithm (GA) and Ant Colony Optimization Algorithm (ACO), to solve the proposed model. …”
Get full text
Get full text

Harmony great deluge for solving curriculum based course timetabling problem by Wahid, Juliana, Mohd Hussin, Naimah

“…University course timetabling which has been determined as non deterministic polynomial problem that accept widely as problem that are intractable.An efficient algorithm does not exist that is guaranteed to find an optimal solution for such problems.The design of good algorithm to find new methods and techniques to solve such problem is a very active area of research.This paper presents the adaption of the hybridizing between harmony search with great deluge algorithm for solving curriculum-based course timetabling problems.The algorithm can be adapted to the problem.Results were not comparatively better than those previously known as best solution.Proper modification in terms of the approach in this algorithm would make the algorithm perform better on curriculum-based course timetabling.…”
Get full text
Get full text
Get full text

Evaluate the performance of university timetabling problem with various artificial intelligence techniques by Hooi, Charmaine Wai Yee

“…Over time, numerous algorithms such as Genetic Algorithm (GA), Particle Swarm Optimization (PSO), Simulated Annealing (SA), and other approaches have been introduced to address the challenges of optimizing class schedules. …”
Get full text
Get full text

Enhancing hyperparameters of LSTM network models through genetic algorithm for virtual learning environment prediction by Ismanto, Edi, Ab Ghani, Hadhrami, Md Saleh, Nurul Izrin

“…Genetic algorithms for hyperparameter optimization significantly contributed, with the GA + LSTM + ADAGRAD model achieving 88% and 87% accuracy in the 7th and 9th models for BBB course data. …”
Get full text
Get full text
Get full text

Investigating a round robin strategy over multi algorithms in optimising the quality of university course timetables by Abdullah S., Shaker K., Shaker H.

“…In this study, we apply three algorithms, that is, Great Deluge, Simulated Annealing and Hill Climbing where the Round Robin algorithm is used as control strategy in choosing the algorithm to be employed at the current stage. …”