Search Results - (( _ application window algorithm ) OR ( web application ((acs algorithm) OR (path algorithm)) ))*

Refine Results
  1. 1

    A Mobile Web Application Engine for Generating Destination-oriented LRT Route by Abdullah, Muhammad Haziq Lim, Saifudin, Wan Sazli Nasaruddin, Hussin, Burairah, Abdul-Aziz, Azlianor, Sulong, Muhammad Suhaizan, Kamalrudin, Massila

    Published 2009
    “…In this paper, we proposed the used of Dijkstra’s Algorithms to provide more effective and intelligent shortest path system to provide the solution for traveler to reach the desired destination.…”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  2. 2
  3. 3

    Development of web-based GIS for traffic management system with obstacle avoidance technique using open source software by Nik Yusoff, Nik Mohd Ramli

    Published 2014
    “…In order to calculate the shortest path between two nodes, Dijkstra algorithm was utilized. …”
    Get full text
    Get full text
    Thesis
  4. 4
  5. 5
  6. 6
  7. 7
  8. 8

    Optimized crossover genetic algorithm for vehicle routing problem with time windows by Nazif, Habibeh, Lee, Lai Soon

    Published 2010
    “…Problem statement: In this study, we considered the application of a genetic algorithm to vehicle routing problem with time windows where a set of vehicles with limits on capacity and travel time are available to service a set of customers with demands and earliest and latest time for serving. …”
    Get full text
    Get full text
    Get full text
    Article
  9. 9

    A Dijkstra’s Mobile Web Application Engine for Generating Integrated Light Rail Transit Route by Haziq Lim, AM, Wan Sazli, NS, Hussin, B., Azlianor, A. A., Suhaizan, SM, Massila, K

    Published 2010
    “…In previous research we are implemented the mobile web application using rules based algorithm where the destination-oriented routes need to be dynamically generated by determining the nearest station according to the specific places. …”
    Get full text
    Get full text
    Get full text
    Article
  10. 10

    An optimized aggregate marker algorithm for bandwidth fairness improvement in classifying traffic networks by Al-Kharasani, Ameen Mohammed Abdulkarem, Othman, Mohamed, Abdullah, Azizol, Kweh, Yeah Lun

    Published 2016
    “…This article analyses and evaluates a new time sliding window traffic marker algorithm called the Optimized time sliding window Three Colour Marker (OtswTCM). …”
    Get full text
    Get full text
    Get full text
    Article
  11. 11

    Efficient Sequential and Parallel Routing Algorithms in Optical Multistage Interconnection Network by Abduh Kaid, Monir Abdullah

    Published 2005
    “…This routing problem is an NPhard problem. Many algorithms are designed by many researchers to perform this routing such as window method, sequential algorithm, degree-descending algorithm, simulated annealing algorithm, genetic algorithm and ant colony algorithm.This thesis explores two approaches, sequential and parallel approaches. …”
    Get full text
    Get full text
    Thesis
  12. 12
  13. 13
  14. 14

    Optimization of LRT Route for Mobile Web Application Engine by Lim, A. M. H., Sazli, N. S. W., Hussin, B., Azlianor, A. A., Suhaizan, S. M., Massila, K.

    Published 2009
    “…In this paper, we proposed the used of Dijkstra’s Algorithms to provide more effective and intelligent shortest path system to provide the solution for traveler to reach the desired destination. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  15. 15

    SLIDING WINDOW TRAINING ALGORITHMS USING MLP-NETWORK FOR CORRELATED AND LOST PACKET DATA by AHMED IZZELDIN, HUZAIFA TAWFEIG

    Published 2012
    “…This thesis gives a systematic investigation of various MLP learning mainly Sliding Window (SW) learning mode which is treated as the adaptation of offline algorithms into online application Consequently this thesis reviews various offline algorithms including: batch backpropagation, nonlinear conjugate gradient, limited memory and full-memory Broyden, Fletcher, Goldfarb and Shanno algorithms and different forms of the latest proposed bimary ensemble learning. …”
    Get full text
    Get full text
    Thesis
  16. 16
  17. 17
  18. 18

    Multi-robot path planning based on the improved nutcracker optimization algorithm and the dynamic window approach by Zhao, Jiangrong, Ding, Hongwei, Zhu, Yuanjing, Yang, Zhijun, Hu, Peng, Wang, Zongshan

    Published 2024
    “…This paper proposes a multi-robot path planning algorithm that integrates the improved nutcracker optimization algorithm with the improved dynamic window approach. …”
    Get full text
    Get full text
    Get full text
    Article
  19. 19
  20. 20