Search Results - (( problem solving based algorithm ) OR ( java applications using algorithm ))

Refine Results
  1. 1

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

    Published 2023
    “…This implementation will be based on parallel distributed model, which will reduce the complexity of each microcontroller to solve large complex problem and increase problem solving speed. � 2008 IEEE.…”
    Conference paper
  2. 2

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

    Published 2009
    “…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
    Monograph
  3. 3

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

    Published 2006
    “…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
    Article
  4. 4

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

    Published 2010
    “…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
    Article
  5. 5

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

    Published 2016
    “…We simulate our proposed algorithms using a Java based simulator that is purposedly built for Grid computing simulations. …”
    Get full text
    Get full text
    Get full text
    Thesis
  6. 6

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

    Published 2011
    “…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
    Monograph
  7. 7

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

    Published 2022
    “…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
    Thesis
  8. 8

    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

    Published 2019
    “…In this research, its content of the step on how to apply the method of WfMS in a mobile application with the use of an android studio. The algorithm for the WfMS is written using Java script in this research. …”
    Get full text
    Get full text
    Student Project
  9. 9

    An enhanced swap sequence-based particle swarm optimization algorithm to solve TSP by Bibi Aamirah Shafaa Emambocus, Muhammed Basheer Jasser, Muzaffar Hamzah, Aida Mustapha, Angela Amphawan

    Published 2021
    “…Several variants of PSO have been proposed for solving discrete optimization problems like TSP. Among them, the basic algorithm is the Swap Sequence based PSO (SSPSO), however, it does not perform well in providing high quality solutions. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  10. 10

    A Genetic Algorithm Based Approach for Solving the Minimum Dominating Set of Queens Problem by Alharbi, Saad, Venkat, Ibrahim

    Published 2017
    “…However, literature shows that limited research has been carried out to solve theMDSQP using bioinspired algorithms. To fill this gap, this paper proposes a simple and effective solution based on genetic algorithms to solve this classical problem. …”
    Get full text
    Get full text
    Get full text
    Article
  11. 11

    Rule-Based Multi-State Gravitational Search Algorithm for Discrete Optimization Problem by Ismail, Ibrahim, Zuwairie, Ibrahim, Zulkifli, Md. Yusof

    Published 2015
    “…In this study, rule-based multi-state gravitational search algorithm (RBMSGSA) algorithm is proposed to solve discrete combinatorial optimization problems. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  12. 12

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

    Published 2013
    “…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
    Conference or Workshop Item
  13. 13

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

    Published 2019
    “…Applications and improvements to the HKA algorithm suggest that optimization algorithm based on estimation principle has a huge potential in solving a wide variety of optimization problems. …”
    Get full text
    Get full text
    Thesis
  14. 14

    A Genetic Algorithm Based Approach for Solving the Minimum Dominating Set of Queens Problem by Alharbi, Saad, Venkat, Ibrahim

    Published 2017
    “…However, literature shows that limited research has been carried out to solve theMDSQP using bioinspired algorithms. To fill this gap, this paper proposes a simple and effective solution based on genetic algorithms to solve this classical problem. …”
    Get full text
    Get full text
    Get full text
    Article
  15. 15
  16. 16

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

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

    Shuffled Frog Leaping Algorithm (SFLA) for solving profit based unit commitment problem / Nurul Izzati Mohd Hanapiah by Mohd Hanapiah, Nurul Izzati

    Published 2016
    “…This thesis presents the Shuffled Frog Leaping Algorithm (SFLA) technique is used to solve the Profit Based Unit Commitment Problem (PBUCP). …”
    Get full text
    Get full text
    Thesis
  18. 18

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

    Published 2017
    “…Thus, this thesis proposed hybrid algorithms between HSA and local search based methods (simulated annealing (SA) and/or great deluge (GD)) to enhance the HSA performance for solving curriculum-based course timetabling (CBCTT) problem which is the variant of UCTP. …”
    Get full text
    Get full text
    Thesis
  19. 19

    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

    Published 2022
    “…Purpose – The purpose of the research is to solve Travelling Salesman Problem (TSP) using Simulated Kalman Filter (SKF) algorithm and single-solution SKF (ssSKF) algorithm based on numerical ordering technique. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  20. 20