Search Results - (( course evaluation method algorithm ) OR ( wave optimization path algorithm ))

Refine Results
  1. 1

    A generalized laser simulator algorithm for optimal path planning in constraints environment by Aisha, Muhammad

    Published 2022
    “…The results demonstrated that the proposed method could generate an optimal collision-free path. Moreover, the proposed algorithm result are compared to some common algorithms such as the A* algorithm, Probabilistic Road Map, RRT, Bi-directional RRT, and Laser Simulator algorithm to demonstrate its effectiveness. …”
    Get full text
    Thesis
  2. 2

    A generalized laser simulator algorithm for mobile robot path planning with obstacle avoidance by Muhammad, Aisha, Ali, Mohammed A.H., Turaev, Sherzod, Abdulghafor, Rawad Abdulkhaleq Abdulmolla, Shanono, Ibrahim Haruna, Alzaid, Zaid, Alruban, Abdulrahman, Alabdan, Rana, Dutta, Ashit Kumar, Almotairi, Sultan

    Published 2022
    “…An optimal path between the start and target point is found by forming a wave of points in all directions towards the target position considering target minimum and border maximum distance principles. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  3. 3

    Novel algorithm for mobile robot path planning in constrained environment by Muhammad, Aisha, Ali, Mohammed A. H., Turaev, Sherzod, Shanono, Ibrahim Haruna, Hujainah, Fadhl, Mohd Zubir, Mohd Nashrul, Faiz, Muhammad Khairi, Mohd Faizal, Erma Rahayu, Abdulghafor, Rawad Abdulkhaleq Abdulmolla

    Published 2021
    “…The results demonstrated that the proposed method is able to generate efficiently an optimal collision-free path. Moreover, the performance of the proposed method was compared with the A-star and laser simulator (LS) algorithms in terms of path length, computational time and path smoothness. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  4. 4

    Novel algorithm for mobile robot path planning in constrained environment by Aisha, Muhammad, Ali, Mohammed A. H., Turaev, Sherzod, Shanono, Ibrahim Haruna, Hujainah, Fadhl, Mohd Nashrul, Mohd Zubir, Muhammad Khairi Faiz, ., Erma Rahayu, Mohd Faizal, Abdulghafor, Rawad

    Published 2022
    “…The results demonstrated that the proposed method is able to generate efficiently an optimal collision-free path. Moreover, the performance of the proposed method was compared with the A-star and laser simulator (LS) algorithms in terms of path length, computational time and path smoothness. …”
    Get full text
    Get full text
    Get full text
    Article
  5. 5

    Novel algorithm for mobile robot path planning in constrained environment by Muhammad, Aisha, Ali, Mohammed A. H., Turaev, Sherzod, Shanono, Ibrahim Haruna, Hujainah, Fadhl, Mohd Nashrul, Mohd Zubir, Muhammad Khairi, Faiz, Erma Rahayu, Mohd Faizal, Abdulghafor, Rawad

    Published 2022
    “…The results demonstrated that the proposed method is able to generate efficiently an optimal collision-free path. Moreover, the performance of the proposed method was compared with the A-star and laser simulator (LS) algorithms in terms of path length, computational time and path smoothness. …”
    Get full text
    Get full text
    Get full text
    Article
  6. 6

    Development of a State-Space Observer for Active Noise Control Systems by Muhssin, Mazin T.

    Published 2009
    “…The secondary path of the ANC system is modeled by using the LMS algorithm to complete the design of the Filtered-X Least Mean Square (FXLMS) controller. …”
    Get full text
    Get full text
    Thesis
  7. 7

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

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

    Efficient and scalable ant colony optimization based WSN routing protocol for IoT by Sharmin, Afsah, Anwar, Farhat, Motakabber, S. M. A.

    Published 2020
    “…For this reason, many intelligent systems have been utilized to design routing algorithms to handle the network's dynamic state. In this paper, an ant colony optimization (ACO) based WSN routing algorithm for IoT has been proposed and analyzed to enhance scalability, to accommodate node mobility and to minimize initialization delay for time critical applications in the context of IoT to find the optimal path of data transmission, improvising efficient IoT communications. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  9. 9

    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
    “…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
  10. 10

    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
    “…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
  11. 11

    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
  12. 12
  13. 13

    Efficient relay placement algorithm using landscape aware routing (erpalar) by Onabajo, Olawale Olusegun

    Published 2011
    “…ERP ALAR was implemented in Matlab R2009a using Genetic Algorithm (GA) with multi-objectives. GA is an optimization algorithm that simulates natural selection process as found in nature. …”
    Get full text
    Get full text
    Thesis
  14. 14

    Using web questionnaire for web-based course evaluation: advantages and disadvantages by Fariborzi, Elham, Abu Bakar, Kamariah, Kasa, Zakaria, Abu Samah, Bahaman, Abdullah, Muhammad Taufik

    Published 2017
    “…This article examines some advantages and disadvantages of conducting Web survey research especially for Web-based course evaluation at Iranian university E-learning centers. …”
    Get full text
    Get full text
    Conference or Workshop Item
  15. 15
  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
    “…In this study, the scheduling problem is represented as a graph where vertices represent time slots and edges represent conflicts or dependencies between courses and lecturers. 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

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

    Published 2025
    “…The research adopts a Genetic Algorithm-based approach, where examination scheduling details such as date, time, course code, program code, student group, student numbers, and available spaces are encoded as chromosomes. …”
    Get full text
    Get full text
    Thesis
  19. 19

    Determination of permeability characteristics of solid/liquid separation using simplex algorithm by Tanaka, Takanori, Kato, Hiroki, Fukuyama, Ryo, Hayashi, Natsuko, Jami, Mohammed Saedi, Iwata, Masashi

    Published 2013
    “…For efficacy evaluation of this estimation method, the permeability data of zinc oxide were determined using the method. …”
    Get full text
    Get full text
    Get full text
    Proceeding Paper
  20. 20

    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