Search Results - (( problem solving _ algorithm ) OR ( java application based algorithm ))

Parallel distributed genetic algorithm development based on microcontrollers framework by Krishnan P.S., Kiong T.S., Koh J.

“…Genetic algorithms are powerful optimizing techniques that are used successfully to solve problems in many different disciplines. …”

Developing an intelligent system to acquire meeting knowledge in problem-based learning environments by Chiang, A., Baba, M.S.

“…Similarly, the algorithm proposed in MALESAbrain can, be used to deal, the problem of conducting a meeting among learners to solve problems. …”
Get full text
Get full text
Get full text

Group formation using genetic algorithm by Che Ani, Zhamri, Husin, Mohd Zabidin, Yasin, Azman

“…Due to the increasing of complexity in software projects, group work is becoming more important in order to ensure quality software products can be delivered on time.Thus, in universities, group work is seen as a good preparation for students to industry because by working in group, it can reduce the individual workload,improve the ability to manage a project and enhance the problem solving skills. However, due to lack of programming skills especially in Java programming language and the inability to have meetings frequently among the group members,most of the students’ software project cannot be delivered successfully.To solve this problem, systematic group formation is one of the initial factors that should be considered to ensure that every group consists of quality individuals who are good in Java programming and also to ensure that every group member in a group are staying closer to each other.In this research, we propose a method for group formation using Genetic Algorithms, where the members for each group will be generated based on the students’ programming skill and location of residential colleges.…”
Get full text
Get full text
Get full text
Get full text

A method for group formation using genetic algorithm by Che Ani, Zhamri, Yasin, Azman, Husin, Mohd Zabidin, Abdul Hamid, Zauridah

“…Due to the increasing of complexity in software projects, group work is becoming more important in order to ensure quality software products can be delivered on time.Thus, in universities, group work is seen as a good preparation for students to enter industry because by working in group, it can reduce the individual workload, improve the ability to manage a project and enhance the problem solving skills. However, due to lack of programming skills especially in Java programming language, most of the students’ software project cannot be delivered successfully.To solve this problem, systematic group formation is one of the initial factors that should be considered to ensure that every group consists of quality individuals who are good in programming.This paper presents a method for group formation using genetic algorithm, where the members for each group will be generated based on the students’ programming skill.…”
Get full text
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

Automated time series forecasting by Ismail, Suzilah, Zakaria, Rohaiza, Tuan Muda, Tuan Zalizam

“…While quantitative technique is based on statistical concepts and requires large amount of data in order to formulate the mathematical models.This technique can be classified into projective and causal technique.The projective technique (or univariate modelling) just involve one variable while the causal technique (or econometric modelling) suitable for multi-variables.Since forecasting involves uncertainty, several methods need to be executed on one set of time series data in order to produce accurate forecast.Hence, usually in practice forecaster need to use several softwares to obtain the forecast values.If this practice can be transformed into algorithm (well-defined rules for solving a problem) and then the algorithm can be transformed into a computer program, less time will be needed to compute the forecast values where in business world time is money.In this study, we focused on algorithm development for univariate forecasting techniques only and will expand towards econometric modelling in the future.Two set of simulated data (yearly and non-yearly) and several univariate forecasting techniques (i.e. …”
Get full text
Get full text
Get full text

Tacit knowledge for business intelligence framework using cognitive-based approach by Surbakti, Herison

“…The framework was tested on 23 librarians from several university libraries in West Java and Yogyakarta, Indonesia. The algorithm starts with a content targeted interview to identify the list of problems faced by librarians. …”
Get full text
Get full text

Development of mobile application of event assistant and booking sport facilities for UiTM Seremban 3 Campus using wofkflow management system / Ahmad Haiqal Abd Halim, Ahmad Yusuf... by Abd Halim, Ahmad Haiqal, Che Hassan, Ahmad Yusuf, Hambari, Mohd Norhafizi

“…Research is conducted to solve the problem by creating an application that fuses the Workflow Management System (WfMS) in the event application at UiTM. …”
Get full text
Get full text

RSA Encryption & Decryption using JAVA by Ramli, Marliyana

“…The implementation of this project will be based on Rapid Application Design Methodology (RAD) and will be more focusing on research and finding, ideas and the implementation of the algorithm, and finally running and testing the 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

Application of genetic algorithm methods to optimize flowshop sequencing problem by Mohd Fadil, Md Sairi

“…At the end of this project, we can see the performance of genetic algorithm method in solving flow shop sequencing problem and types of flow shop sequencing problems that can be solve through genetic algorithm method. …”
Get full text
Get full text

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

“…An adaptive bats sonar algorithm is proposed for solving single objective optimisation problems. …”
Get full text
Get full text

Application of adaptive bats sonar algorithm for solving a single objective of practical business optimisation problem PROBLEM by Nafrizuan, Mat Yahya, M. Nafis, O. Z.

“…An adaptive bats sonar algorithm to solve single objective optimisation problem is presented. …”
Get full text
Get full text
Get full text

Iterative methods for solving split common fixed point problems in Hilbert spaces by Mohammed, Lawan Bulama

“…Our interest here is to apply these mappings to propose some algorithms for solving split common fixed point problems and its variant forms, in the end, we prove the convergence results of these algorithms. …”
Get full text
Get full text
Get full text

A discrete simulated kalman filter optimizer for combinatorial optimization problems by Suhazri Amrin, Rahmad

“…Due to the practical significance of this problem in real-world issues, numerous algorithms have been proposed to solve it. …”
Get full text
Get full text

Solving 0/1 Knapsack Problem Using Hybrid HS and Jaya Algorithms by Alomoush, Alaa A., Alsewari, Abdulrahman A., Alamri, Hammoudeh S., Kamal Z., Zamli

“…Solving knapsack problem consider NP hard problem and many previous research tried to find optimal solution for it. …”
Get full text
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

Simulated kalman filter with modified measurement, substitution mutation and hamming distance calculation for solving traveling salesman problem by Suhazri Amrin, Rahmad, Zuwairie, Ibrahim, Zulkifli, Md. Yusof

“…Findings – The results of the SKF algorithm and the ssSKF algorithm will be evaluated to decide which algorithm is better at solving this type of problem. …”
Get full text
Get full text
Get full text
Get full text

Direct approach for mining association rules from structured XML data by Abazeed, Ashraf Riad

Get full text
Get full text

Levy slime mould algorithm for solving numerical and engineering optimization problems by J. J., Jui, M. A., Ahmad, M. I. M., Rashid

“…The proposed Levy Slime Mould Algorithm (LSMA) is a novel metaheuristic algorithm that integrates the Levy distribution into a new metaheuristic called Slime Mould Algorithm (SMA) for solving numerical and engineering problems. …”
Get full text
Get full text
Get full text