Search Results - (( course evaluation study algorithm ) OR ( between transportation issues algorithm ))

Refine Results
  1. 1

    Using algorithmic taxonomy to evaluate lecturer workload by Hashim, Ruhil Hayati, Abdul Hamid, Jamaliah, Selamat, Mohd Hasan, Ibrahim, Hamidah, Abdullah, Rusli, Mohayidin, Mohd Ghazali

    Published 2006
    “…The taxonomy is a dynamic hierarchy that extracts validated parameters from the dataset. Results of the study highlight the contributions of this algorithmic method in better evaluation of teaching workload for lecture.…”
    Get full text
    Get full text
    Get full text
    Article
  2. 2

    Using algorithmic taxonomy to evaluate lecture workload: a case study of services application prototype in the UPM KM Portal by Abdul Hamid, Jamaliah, Mohayidin, Mohd Ghazali, Selamat, Mohd Hasan, Ibrahim, Hamidah, Abdullah, Rusli, Hashim, Ruhil Hayati

    Published 2006
    “…The taxonomy is a dynamic hierarchy that extracts validated parameters from the dataset. Results of the study highlight the contributions of this algorithmic method in better evaluation of teaching workload for lecture.…”
    Get full text
    Get full text
    Conference or Workshop Item
  3. 3

    Automated study plan generator using rule-based and knapsack problem by Salahuddin, Lizawati, Hashim, Ummi Rabaah, Salahuddin, Lizawati

    Published 2022
    “…Hence, this study aims to propose an algorithm to generate an automated and accurate study plan throughout the study duration. …”
    Get full text
    Get full text
    Get full text
    Article
  4. 4

    Evaluate the performance of university course timetabling problem with different combinations of genetic algorithm by Foo, Yao Heng

    Published 2025
    “…University course timetabling problem (UCTP) is a scheduling problem that requires courses to be assigned to the limited time slots, classrooms, and lecturers, while adhering to a set of predefined constraints. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
  5. 5

    Using algorithmic taxonomy to evaluate lecture workload: A case study of services application prototype in the UPM KM portal by Abdul Hamid, Jamaliah, Mohayidin, Mohd Ghazali, Selamat, Mohd Hassan, Ibrahim, Hamidah, Abdullah, Rusli, Hashim, Ruhil Hayati

    Published 2006
    “…Lecturer workload at universities includes three major categories: teaching, research and services.Teaching workload is influence by various factors such as level taught courses, number of student, credit and contact hour and off campus or on campus course design.The UPM has a KM Portal that contains sets of metadata on lecturer profile and knowledge assets.The Lecturer profile contains information lecturer teaching, research, publication and many more.We constructed an algorithmic taxonomy based at the lecturer profile data to measure lecturer teaching workload.This method measures the lecturer teaching workload.The taxonomy is a dynamic hierarchy that extracts validated parameters from the dataset.Results of the study highlight the contributions of this algorithmic method in better evaluation of teaching workload for lecture.…”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  6. 6

    Optimization of Feeder Bus Routes for Electric Train Service using Ant Colony Algorithm by Yung, Dellon Tan Tzet

    Published 2014
    “…In order to address this issue, an optimised feeder bus system is proposed. …”
    Get full text
    Get full text
    Final Year Project
  7. 7
  8. 8

    Cluster optimization in VANET using MFO algorithm and K-Means clustering by Ramlee, Sham Rizal, Hasan, Sazlinah, K. Subramaniam, Shamala

    Published 2023
    “…Proven to be an effective and efficient method for solving optimization problem. To design K-Means algorithm that portion nodes based on their proximities by optimize the distance between nodes within same cluster by assigning them to the closet cluster center. …”
    Get full text
    Get full text
    Conference or Workshop Item
  9. 9

    Space allocation for examination scheduling using Genetic Algorithm / Alya Kauthar Azman by Azman, Alya Kauthar

    Published 2025
    “…Data for the study was collected from university records, and algorithm performance was tested against predefined scheduling criteria. …”
    Get full text
    Get full text
    Thesis
  10. 10
  11. 11

    Geographical and maximum distance on-demand routing algorithm G-MDORA by Mohammed D., Bin Mansor M., Hock G.C.

    Published 2024
    “…As a result, a better traffic system is required to address this issue. VANET is a cutting-edge network that primarily delivers intelligent transportation system (ITS) services to end-users to facilitate data exchange and ensure safety. …”
    Article
  12. 12

    Prediction of MUET result based on KNN algorithm / Siti Fatimah Azzahra Hamrizan by Hamrizan, Siti Fatimah Azzahra

    Published 2021
    “…The exam results from the ELC can be the features to help the students to know if they can pass the MUET exam and the lecturers can figure out which language skills need to be improved to help preparing the students to sit for MUET. The study aims to explore the K-Nearest Neighbour (KNN) algorithm in solving the MUET result prediction problem, to develop a prototype of MUET result prediction based on the KNN algorithm and to evaluate the accuracy of the KNN algorithm in MUET result prediction. …”
    Get full text
    Get full text
    Thesis
  13. 13
  14. 14

    Gait identification and optimisation for amphi-underwater robot by using ant colony algorithm by Mohd Yusof, Muhammad Syafiq, Toha @ Tohara, Siti Fauziah

    Published 2019
    “…For the optimization, the robot will travel from one specific point to another with the predefined position within optimized gait and fastest time by using Ant Colony Optimization (ACO) technique. The algorithm being compared, between Ant Colony Algorithm (ACO) and the Particle Swarm Optimisation (PSO) in terms of time and distance. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  15. 15

    Recommendation system in selecting course of public university in Malaysia using K-nearest neighbour by Thoi, Wen Bin

    Published 2018
    “…The objectives of this project are to study the current algorithm and technique in recommendation systems for selecting courses; to implement k-Nearest Neighbour in the recommendation system; and to evaluate the application of the recommendation system. …”
    Get full text
    Get full text
    Get full text
    Undergraduates Project Papers
  16. 16

    Graph theory approach for managing lecturers’ schedule using graph colouring method / Siti Nor Ba Basri, Nur Su’aidah Khozaid and Farhana Hazwani Ismail by Basri, Siti Nor Ba, Khozaid, Nur Su’aidah, Ismail, Farhana Hazwani

    Published 2023
    “…Different colours are allocated to each vertex using graph colouring techniques such as the vertices algorithm or the edges algorithm, ensuring that clashing courses and lecturers are assigned different time slots. …”
    Get full text
    Get full text
    Student Project
  17. 17
  18. 18

    CSC649 - Special Topics in Computer Science / College of Computing, Informatics and Media by UiTM, College of Computing, Informatics and Media

    Published 2022
    “…The course will cover specialized technology and described in terms of frameworks and problem formulations, standard models, methods, computational tools, algorithms, as well as methodologies to evaluate the system and select optimal models. …”
    Get full text
    Get full text
    Get full text
    Teaching Resource
  19. 19

    CSC649: Special Topics in Computer Science / College of Computing, Informatics and Mathematics by UiTM, College of Computing, Informatics and Mathematics

    Published 2018
    “…The course will cover specialized technology and described in terms of frameworks and problem formulations, standard models, methods, computational tools, algorithms, as well as methodologies to evaluate the system and select optimal models. …”
    Get full text
    Get full text
    Get full text
    Teaching Resource
  20. 20