Search Results - (( initial solution based algorithm ) OR ( using gamification learning algorithm ))

Refine Results
  1. 1

    Open access for gamification: a systematic review of literature across disciplines by Zakaria, Noor Syamilah, Saripan, M. Iqbal, Subarimaniam, Neerushah, Ismail, Alyani

    Published 2020
    “…With the increasing need for developing effective learning methods, gamification has been widely used as a tool to improve the desire and interest in learning. …”
    Get full text
    Get full text
    Get full text
    Article
  2. 2
  3. 3

    Gamification of Regional Tourism Engagement: Analysis and Design of a Web-Based Information System by Johannes Hamonangan, Siregar, Rufman Iman, Akbar, Augury, El Rayeb, Chaerul, Anwar, Suriati Khartini, Jali, Mohamad Imran, Bandan, Phei Chin, Lim, Abby Lian, Hendrick

    Published 2025
    “…The system integrates a structured gamification algorithm with a scalable relational database model, built using React.js and Firebase, to ensure responsive and consistent user experiences. …”
    Get full text
    Get full text
    Get full text
    Proceeding
  4. 4

    Design and statistical analysis of initial solution construction approach in curriculum based course timetabling problem by Wahid, Juliana, Mohd Hussin, Naimah

    Published 2017
    “…To produce a population of initial solution require algorithm that can produce multiple feasible solutions and these solutions must be diverse. …”
    Get full text
    Get full text
    Conference or Workshop Item
  5. 5

    Designing machine learning frameworks for intelligence and gamification research / Nordin Abu Bakar by Abu Bakar, Nordin

    Published 2016
    “…The knowledge will be stored, used, referred, postulated and reasoned with. Those activities define learning in its own specific domain and context. …”
    Get full text
    Get full text
    Thesis
  6. 6
  7. 7

    Clustering ensemble learning method based on incremental genetic algorithms by Ghaemi, Reza

    Published 2012
    “…Firstly, an architecture for the clustering ensemble based on incremental genetic-based algorithms is proposed consisting of two phases: (i) to produce cluster partitions as initial populations, (ii) to combine cluster partitions and to generate final clustering solution by incremental genetic based clustering ensemble learning algorithm. …”
    Get full text
    Get full text
    Thesis
  8. 8
  9. 9

    Enhancing the Sorting Layers in the Initial Stage of High School Timetabling by Arbaoui, Billel, Wahid, Juliana, Abdul-Rahman, Syariza

    Published 2020
    “…KHE is an algorithm that generates initial solution of HSTP. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  10. 10

    Enhanced Harris's Hawk algorithm for continuous multi-objective optimization problems by Yasear, Shaymah Akram

    Published 2020
    “…Harris’s hawk multi-objective optimizer (HHMO) algorithm is a MOSIbased algorithm that was developed based on the reference point approach. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  11. 11

    Optimizing S-box generation based on the Adaptive Agent Heroes and Cowards Algorithm by Kamal Z., Zamli

    Published 2021
    “…This paper introduces a new variant of a metaheuristic algorithm based on Agent Heroes and Cowards Algorithm (AHC), called Adaptive Agent Heroes and Cowards Algorithm (AAHC). …”
    Get full text
    Get full text
    Get full text
    Article
  12. 12

    Construction of initial solution population for curriculum-based course timetabling using combination of graph heuristics by Wahid, Juliana, Mohd Hussin, Naimah

    Published 2016
    “…The construction of population of initial solution is a crucial task in population-based metaheuristic approach for solving curriculum-based university course timetabling problem because it can affect the convergence speed and also the quality of the final solution.This paper presents an exploration on combination of graph heuristics in construction approach in curriculum based course timetabling problem to produce a population of initial solutions.The graph heuristics were set as single and combination of two heuristics.In addition, several ways of assigning courses into room and timeslot are implemented.All settings of heuristics are then tested on the same curriculum based course timetabling problem instances and are compared with each other in terms of number of population produced.The result shows that combination of largest degree followed by saturation degree heuristic produce the highest number of population of initial solutions.The results from this study can be used in the improvement phase of algorithm that uses population of initial solutions…”
    Get full text
    Get full text
    Get full text
    Article
  13. 13
  14. 14

    Vehicle Routing Problem with Simultaneous Pickup and Delivery by Sze, San Nah, Sek, Siaw Ying Doreen, Sze, Jeeu Fong, Cheah, Wai Shiang, Chiew, Kang Leng

    Published 2020
    “…A simple heuristic is used to generate the initial solution in the first phase. Then, the feasible solution obtained in the first phase will become the initial input for the improvement phase, which applied the VNS algorithm. …”
    Get full text
    Get full text
    Article
  15. 15

    Study on numerical solution of a variable order fractional differential equation based on symmetric algorithm by Liu, Jingrui, Pan, Dongyang

    Published 2019
    “…As the class of fractional differential equations with changing order has attracted more attention and attention in the fields of research and engineering, it is important to study its numerical solutions. Numerical solution algorithm for a class of fractional differential equations with transformed arrays based on the proposed symmetry algorithm. …”
    Get full text
    Get full text
    Get full text
    Article
  16. 16
  17. 17

    Constructing population of initial solutions for curriculum – based course timetabling problem by Wahid, Juliana, Mohd Hussin, Naimah

    Published 2012
    “…Future work will use the best settings of heuristics to the improvement phase in population-based improvement algorithm.…”
    Get full text
    Get full text
    Conference or Workshop Item
  18. 18
  19. 19

    Flexible job shop scheduling using priority heuristics and genetic algorithm by Farashahi, Hamid Ghaani

    Published 2010
    “…In the next method, a genetic algorithm has been developed. It has been shown that proposed genetic algorithm with a reinforced initial population (GA2) has better efficiency compared to a proposed genetic algorithm with fully random initial population (GA0). …”
    Get full text
    Get full text
    Thesis
  20. 20

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

    Published 2019
    “…However, the HKA algorithm has its own flaws. Although it was introduced as a population-based stochastic optimization algorithm, HKA is not exactly a population-based algorithm because it initializes and updates only a single solution. …”
    Get full text
    Get full text
    Thesis