Search Results - (( based replication path algorithm ) OR ( program validation using algorithm ))

Refine Results
  1. 1

    Optimization of mobile robot path planning in semi-dynamic environment using genetic algorithm by Kasim Hawari, Mohd Zarifitri

    Published 2023
    “…The environment design for mobile robots' path planning based on industry environment shows excellent combinations with the GA method that generate the optimal path for the mobile robot with a semi-dynamic obstacle.…”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  2. 2

    An Enhanced Simulated Annealing Routing Algorithm for Semi-Diagonal Torus Network by Noraziah, Adzhar, Shaharuddin, Salleh

    Published 2017
    “…In order to achieve this objective, each node must be connected in its shortest way as possible. We start our algorithm by designing shortest path algorithm based on Dijkstra's method. …”
    Get full text
    Get full text
    Get full text
    Article
  3. 3

    A Novel Path Prediction Strategy for Tracking Intelligent Travelers by Motlagh, Omid Reza Esmaeili

    Published 2009
    “…Experimental works show the capabilities of the developed DSS in human path prediction using both simulated and actual WLAN-based positioning dataset. …”
    Get full text
    Get full text
    Thesis
  4. 4
  5. 5

    Mobile Crowd Steering Evacuation Model via Agent Based Simulation by Applying the Social Force Model by Norhaida, Binti Hussain, Wai Shiang, Cheah, Wai Loke, Seng

    Published 2025
    “…Famous simulation models include agent-based crowd guiding. The evaluation states that the existing agent-based steering model computes the complete set of collision-free paths with the least travel time among agents to make path decisions based on updated information. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  6. 6

    Routing problem in rectangular mesh network using Dijkstra’s based Greedy method by Noraziah, Adzhar, Shaharuddin, Salleh, Yuhani, Yusof, Muhammad Azrin, Ahmad

    Published 2018
    “…Therefore, developing a shortest path based routing algorithm is in need. In this research, Dijkstra’s algorithm is used to establish the shortest connection for each net. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  7. 7
  8. 8
  9. 9

    System identification using Extended Kalman Filter by Alias, Ahmad Hafizi

    Published 2017
    “…In order to evaluate the performance of the EKF learning algorithm, the proposed algorithm validation were analyzed using model validation methods as a checker such as One Step Ahead (OSA) and correlation coefficient (R2). …”
    Get full text
    Get full text
    Student Project
  10. 10

    A multi-depot vehicle routing problem with stochastic road capacity and reduced two-stage stochastic integer linear programming models for rollout algorithm by Anuar, Wadi Khalid, Lee, Lai Soon, Seow, Hsin Vonn, Pickl, Stefan

    Published 2021
    “…Then an extension, MDVRPSRC-2S, is presented as an offline two-stage SILP model of the MDDVRPSRC. These models are validated using small simulated instances with CPLEX. …”
    Get full text
    Get full text
    Article
  11. 11
  12. 12

    Solving Sudoku puzzles in Binary Integer Linear Programming using Branch and Bound algorithm / Ahida Waliyyah Ahmad Fuad by Ahmad Fuad, Ahida Waliyyah

    Published 2024
    “…This study explores the application of a Binary Integer Linear Programming (BILP) model combined with the Branch and Bound (B&B) algorithm to solve Sudoku puzzles. …”
    Get full text
    Get full text
    Thesis
  13. 13

    Augmentation of basic-line-search and quick-simplex-method algorithms to enhance linear programming computational performance by Nor Azlan, Nor Asmaa Alyaa

    Published 2021
    “…Whereas, the validation from the real-world of the two datasets showed that the new augmentation algorithm steadily producing lesser iteration number compared to the conventional Simplex, QSM and BLSA algorithms. …”
    Get full text
    Get full text
    Get full text
    Thesis
  14. 14

    Optimizing Visual Surveillance Sensor Coverage Using Dynamic Programming by Altahir, A.A., Asirvadam, V.S., Hamid, N.H.B., Sebastian, P., Saad, N.B., Ibrahim, R.B., Dass, S.C.

    Published 2017
    “…To validate the proposed algorithm, we compared the outcomes of the dynamic programming algorithm with the existing benchmarking placement optimization techniques. …”
    Get full text
    Get full text
    Article
  15. 15

    Priority and dynamic quantum time algorithms for central processing unit scheduling by Mohammed, Maysoon A.

    Published 2018
    “…Central Processing Unit is scheduled using different types of scheduling algorithms. One of the most widely algorithm used in scheduling with sharing and batch operating systems is Round Robin. …”
    Get full text
    Get full text
    Thesis
  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
    “…This study seeks to optimize the scheduling process by employing a graph theory approach with graph colouring method, as well as results validation by Integer Linear Programming (ILP) based on the graph colouring outcome by using the Phyton programming software, to effectively assign time slots for courses and lecturers while managing the risk of clashes and omissions. …”
    Get full text
    Get full text
    Student Project
  17. 17

    Novice programmers’ emotion and competency assessments using machine learning on physiological data / Fatima Jannat by Fatima, Jannat

    Published 2022
    “…Hyper-parameter tuning has been used in all the algorithms using k-fold cross validation to have the best accuracy and to avoid the over-fitting issue. …”
    Get full text
    Get full text
    Get full text
    Thesis
  18. 18

    Model structure selection for a discrete-time non-linear system using a genetic algorithm by Ahmad, R., Jamaluddin, H., Hussain, M. A.

    Published 2004
    “…The performance of the proposed algorithm is also compared to the model developed using the orthogonal least squares (OLS) algorithm. …”
    Get full text
    Get full text
    Article
  19. 19

    Model structure selection for a discrete-time non-linear system using a genetic algorithm by Ahmad, R., Jamaluddin, H., Hussain, M. A.

    Published 2004
    “…The performance of the proposed algorithm is also compared to the model developed using the orthogonal least squares (OLS) algorithm. …”
    Get full text
    Get full text
    Article
  20. 20

    Model structure selection for a discrete-time non-linear system using genetic algorithm by Ahmad, Robiah, Jamaluddin , Hishamuddin, Hussain, Mohd. Azlan

    Published 2004
    “…The performance of the proposed algorithm is also compared to the model developed using the orthogonal least squares (OLS) algorithm. …”
    Get full text
    Get full text
    Get full text
    Article