Search Results - (( using selection problems algorithm ) OR ( java application scheduling algorithm ))

Computer Lab Timetabling Using Genetic Algorithm Case Study - Unit ICT by Abdullah, Amran

“…Genetic Algorithm is one of the most popular optimization solutions used in various applications such as scheduling. …”
Get full text
Get full text

Improving Class Timetabling using Genetic Algorithm by Qutishat, Ahmed Mohammed Ali

“…This paper reports the power fill techniques using GA in scheduling. Class timetabling problem is one of the applications in scheduling. …”
Get full text
Get full text
Get full text

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

“…The resource allocation problem is modeled as a graph that can be used by the ant to deliver its pheromone. …”
Get full text
Get full text
Get full text

Examination timetabling using genetic algorithm case study: KUiTTHO by Mohd Salikon, Mohd Zaki

“…This paper reports the powerful techniques using GA in scheduling. Examination timetabling problem is one of the applications in scheduling. …”
Get full text
Get full text

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

“…Offloading heavy data size to a remote node introduces the problem of additional delay due to transmission. Therefore, in this paper, we proposed Dynamic tasks scheduling algorithm based on attribute reduction with an enhanced hybrid Genetic Algorithm and Particle Swarm Optimization for optimal device selection. …”
Get full text
Get full text

Examination Timetabling Using Genetic Algorithm Case Study : KUiTTHO by Mohd. Zaki, Mohd. Salikon

“…This paper reports the powerful techniques using GA in scheduling. Examination timetabling problem is one of the applications in scheduling. …”
Get full text
Get full text
Get full text

A Toolkit for Simulation of Desktop Grid Environment by FOROUSHAN, PAYAM CHINI

“…In this type of environment it is nearly impossible to prove the effectiveness of a scheduling algorithm. Hence the main objective of this study is to develop a desktop grid simulator toolkit for measuring and modeling scheduler algorithm performance. …”
Get full text
Get full text

Batch mode heuristic approaches for efficient task scheduling in grid computing system by Maipan-Uku, Jamilu Yahaya

“…Many algorithms have been implemented to solve the grid scheduling problem. …”
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 resource allocation problem is modelled 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. …”
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

Performance evaluation of real-time multiprocessor scheduling algorithms by Alhussian, H., Zakaria, N., Abdulkadir, S.J., Fageeri, S.O.

“…The CPU profiler of JavaTM VisualVM measures the number of invocations of scheduling event handlers (procedures) in each algorithm as well as the total time spent in all invocations of this handler. …”
Get full text
Get full text

Classroom finder system with student availability, space and time constraint by Loh, Yong Bin

Get full text
Get full text

Smart student timetable planner by Wong, Xin Tong

“…Course data is managed in CSV format, parsed into JSON for fast processing, while sessionStorage and localStorage handle user data within active sessions. A Genetic Algorithm forms the core scheduling engine, generating optimized timetables that respect both hard constraints, such as avoiding clashes, and soft constraints, such as personal preferences.The final output of this project is a functional web-based timetable planner that successfully enhances scheduling efficiency, reduces the likelihood of errors, and improves the overall academic planning experience. …”
Get full text
Get full text

Smart appointment organizer for mobile application / Mohd Syafiq Adam by Adam, Mohd Syafiq

“…In creating this application, NetBeans IDE 6.5and Java Micro Edition (Java ME) are used. …”
Get full text
Get full text

Formulating new enhanced pattern classification algorithms based on ACO-SVM by Alwan, Hiba Basim, Ku-Mahamud, Ku Ruhana

“…ACO originally deals with discrete optimization problem.In applying ACO for solving SVM model selection problem which are continuous variables, there is a need to discretize the continuously value into discrete values.This discretization process would result in loss of some information and hence affects the classification accuracy and seeking time.In this algorithm we propose to solve SVM model selection problem using IACOR without the need to discretize continuous value for SVM.The second algorithm aims to simultaneously solve SVM model selection problem and selects a small number of features.SVM model selection and selection of suitable and small number of feature subsets must occur simultaneously because error produced from the feature subset selection phase will affect the values of SVM model selection and result in low classification accuracy.In this second algorithm we propose the use of IACOMV to simultaneously solve SVM model selection problem and features subset selection.Ten benchmark datasets were used to evaluate the proposed algorithms.Results showed that the proposed algorithms can enhance the classification accuracy with small size of features subset.…”
Get full text
Get full text
Get full text

Improved Salp Swarm Algorithm based on opposition based learning and novel local search algorithm for feature selection by Tubishat, Mohammad, Idris, Norisma, Shuib, Liyana, Abushariah, Mohammad A.M., Mirjalili, Seyedali

“…An improved version of Salp Swarm Algorithm (ISSA) is proposed in this study to solve feature selection problems and select the optimal subset of features in wrapper-mode. …”
Get full text
Get full text

Dengue classification system using clonal selection algorithm / Karimah Mohd by Mohd, Karimah

“…Some popular intelligent techniques like Genetic Algorithm, Fuzzy Logic and Artificial Neural Network are often used by reasearcher to perform classifcation problems. …”
Get full text
Get full text

Feature selection and model selection algorithm using incremental mixed variable ant colony optimization for support vector machine classifier by Alwan, Hiba Basim, Ku-Mahamud, Ku Ruhana

“…In order to enhance SVM performance, these problems must be solved simultaneously because error produced from the feature subset selection phase will affect the values of the SVM parameters and resulted in low classification accuracy.Most approaches related with solving SVM model selection problem will discretize the continuous value of SVM parameters which will influence its performance.Incremental Mixed Variable Ant Colony Optimization (IACOMV) has the ability to solve SVM model selection problem without discretising the continuous values and simultaneously solve the two problems.This paper presents an algorithm that integrates IACOMV and SVM.Ten datasets from UCI were used to evaluate the performance of the proposed algorithm.Results showed that the proposed algorithm can enhance the classification accuracy with small number of features.…”
Get full text
Get full text
Get full text

A Comparative Study on three Component Selection Mechanisms for Hyper-Heuristics in Expensive Optimization by Jia Hui Ong, Jason Teo

“…Numerous studies in optimization problems often lead to tailoring a specific algorithm to adapt to the problem instances, especially in expensive optimization problems. …”
Get full text
Get full text
Get full text

Diagnosis of eyesight using Improved Clonal Selection Algorithm (ICLONALG) / Nor Khirda Masri by Masri, Nor Khirda

“…This study aims to implement the classification algorithm using the Improved Clonal Selection Algorithm (ICLONALG) to classify the eyesight’s problems. …”
Get full text
Get full text