Search Results - (( using modification path algorithm ) OR ( java application testing algorithm ))

Refine Results
  1. 1

    Modification of dijkstra's algorithm for safest and shortest path during emergency evacuation by Khyrina Airin Fariza, Abu Samah, Burairah, Hussin, Abd Samad, Hasan Basari

    Published 2015
    “…Therefore, this paper presents the methodology used for the modification of Dijkstra's algorithm to find the safest and shortest path. …”
    Get full text
    Get full text
    Get full text
    Article
  2. 2

    Optimization Of Two-Dimensional Dual Beam Scanning System Using Genetic Algorithms by Koh, Johnny Siaw Paw

    Published 2008
    “…This thesis presents a new approach to optimize the performance of a dual beam optical scanning system in terms of its scanning combinations and speed, using Genetic Algorithm (GA). The problem has been decomposed into two sub problems; task segregation, where the scanning tasks need to be segregated and assigned for each scanner head, and path planning where the best combinatorial paths for each scanner are determined in order to minimize the total motion of scanning time. …”
    Get full text
    Get full text
    Thesis
  3. 3

    A review on path planning and obstacle avoidance algorithms for autonomous mobile robots by Anis Naema Atiyah, Rafai, Noraziah, Adzhar, Nor Izzati, Jaini

    Published 2022
    “…This paper reviews the mobile robot navigation approaches and obstacle avoidance used so far in various environmental conditions to recognize the improvement of path planning strategists. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  4. 4

    RSA Encryption & Decryption using JAVA by Ramli, Marliyana

    Published 2006
    “…The implementation of this project will be based on Rapid Application Design Methodology (RAD) and will be more focusing on research and finding, ideas and the implementation of the algorithm, and finally running and testing the algorithm. …”
    Get full text
    Get full text
    Final Year Project
  5. 5

    Graph processing hardware accelerator for shortest path algorithms in nanometer very large-scale integration interconnect routing by Ch'ng, Heng Sun

    Published 2007
    “…In order to utilize the high performance hardware priority queue module, modifications have to be made on the graph-based shortest path algorithm. …”
    Get full text
    Get full text
    Get full text
    Thesis
  6. 6

    Enhancing performance of global path planning for mobile robot through Alpha–Beta Guided Particle Swarm Optimization (ABGPSO) algorithm by Ahmad, Javed, Ab Wahab, Mohd Nadhir, Ramli, Ahmad, Misro, Md Yushalify, Ezza, Wan Zafira, Wan Hasan, Wan Zuha

    Published 2025
    “…Experiments were carried out in four different layouts related to path-planning environments, and comparisons were made with various existing path-planning algorithms. …”
    Get full text
    Get full text
    Get full text
    Article
  7. 7

    Integration of enchanced jump point search (JPS) algorithm with modified bresenham technique for path planning in virtual grid-based environment by Nurul Atikah Janis

    Published 2018
    “…Bresenham Line Algorithm is a line generation algorithm using integer arithmetic where the points (x1, y1) and (x2, y2) are assumed not equal and integer valued. …”
    Get full text
    Get full text
    Get full text
    Thesis
  8. 8

    Modelling Autonomous Evacuation Navigation System (AENS) for optimal route using Dijkstra's algorithm by Abu Samah, Khyrina Airin Fariza

    Published 2016
    “…Through ST adaptation, all subsystems were integrated and using the “Dijkstra’s algorithm” (DA) by modifying its function from shortest path algorithm to safest and shortest algorithm, to the nearest exit. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  9. 9

    Research on risk detection of autonomous vehicle based on rapidly-exploring random tree by Yincong Ma, Lim, Kit Guan, Tan, Min Keng, Sin, Helen Ee Chuo, Ali Farzamnia, Tze, Kenneth Kin Teo

    Published 2023
    “…On the premise of ensuring safety and meeting the requirements of the vehicle’s kinematic constraints through the expansion of obstacles, the dynamic step size is used for random tree growth. A non-particle collision detection (NPCD) collision detection algorithm and path modification (PM) path modification strategy are proposed for the collision risk in the turning process, and geometric constraints are used to represent the possible security threats, so as to improve the efficiency and safety of vehicle global path driving and to provide reference for the research of driverless vehicles.…”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  10. 10

    Multi agent quality of service routing based on scheme ant colony optimization algorithm by Baygi, Maassoumeh Javadi

    Published 2014
    “…This study also introduces a new probe-based procedure for discovery and setup QoS path for real-time traffic. The proposed scheme has been simulated by OMNET++ and compared with standard AntNet and two well-known standard QoS routings; Widest Shortest Path (WSP) algorithm and Shortest Widest Path (SWP) algorithm. …”
    Get full text
    Get full text
    Thesis
  11. 11

    Design, development and performance optimization of a new artificial intelligent controlled multiple-beam optical scanning module by Koh, Johnny Siaw Paw, Aris, Ishak, Ramachandaramurthy, Vigna Kumaran, Bashi, Sinan Mahmod, Marhaban, Mohammad Hamiruce

    Published 2006
    “…This research presents a new approach to optimise the performance of a multiple-beam optical scanning system in terms of its marking combinations and speed, using Genetic Algorithm (GA). The problem has been decomposed into two sub problems; task segregation, where the marking tasks need to be segregated and assigned for each scanner head and path planning where the best combinatorial paths for each scanner are determined in order to minimise the total motion of marking time. …”
    Get full text
    Get full text
    Get full text
    Article
  12. 12

    Development of obstacle avoidance technique in web-based geographic information system for traffic management using open source software by Nik Yusoff, Nik Mohd Ramli, Mohd Shafri, Helmi Zulhaidi, Muniandy, Ratnasamy, Mohammad Wali, Islam

    Published 2014
    “…Therefore, this study was conducted to enable obstacle avoidance function in the existing pgRouting algorithm using OpenStreetMap road network. By implementing this function, it enhances the Dijkstra algorithm ability in network analysis. …”
    Get full text
    Get full text
    Get full text
    Article
  13. 13

    Design, development and performance optimization of a new artificial intelligent controlled multiple-beam optical scanning module by Koh J.S.P., Aris I.B., Ramachandaramurthy V.K., Bashi S.M., Marhaban M.H.

    Published 2023
    “…This research presents a new approach to optimise the performance of a multiple-beam optical scanning system in terms of its marking combinations and speed, using Genetic Algorithm (GA). The problem has been decomposed into two sub problems; task segregation, where the marking tasks need to be segregated and assigned for each scanner head and path planning where the best combinatorial paths for each scanner are determined in order to minimise the total motion of marking time. …”
    Article
  14. 14

    Design, development and performance optimization of a new artificial intelligent controlled multiple-beam optical scanning module by Koh J.S.P., Aris I.B., Ramachandaramurthy V.K., Bashi S.M., Marhaban M.H.

    Published 2023
    “…This research presents a new approach to optimise the performance of a multiple-beam optical scanning system in terms of its marking combinations and speed, using Genetic Algorithm (GA). The problem has been decomposed into two sub problems; task segregation, where the marking tasks need to be segregated and assigned for each scanner head and path planning where the best combinatorial paths for each scanner are determined in order to minimise the total motion of marking time. …”
    Article
  15. 15

    Comparison of Search Algorithms in Javanese-Indonesian Dictionary Application by Yana Aditia, Gerhana, Nur, Lukman, Arief Fatchul, Huda, Cecep Nurul, Alam, Undang, Syaripudin, Devi, Novitasari

    Published 2020
    “…Performance Testing is used to test the performance of algorithm implementations in applications. …”
    Get full text
    Get full text
    Journal
  16. 16

    Wormhole attack detection mechanism in mobile ad hoc network using neighborhood information and path tracing algorithm by Enshaei, Mehdi

    Published 2015
    “…In this study, a new defence mechanism is proposed based on modification of the packet forwarding process, using Neighborhood Information (NI) and PT algorithm, and known as NIPT algorithm. …”
    Get full text
    Get full text
    Thesis
  17. 17

    Articulated robots motion planning using foraging ant strategy by Mohamad, Mohd. Murtadha

    Published 2008
    “…This paper proposes a novel search technique, the F-Ant algorithm, in order to find a reliable path between the initial configuration and the goal configuration of the articulated robot. …”
    Get full text
    Get full text
    Article
  18. 18
  19. 19

    Implementation of (AES) Advanced Encryption Standard algorithm in communication application by Moh, Heng Huong

    Published 2014
    “…The concept of ABS algorithm was firstly studied, including the definition, historical background, and a brief comparison was made between the ABS algorithm with other types of algorithm. …”
    Get full text
    Get full text
    Undergraduates Project Papers
  20. 20

    Classification System for Heart Disease Using Bayesian Classifier by Magendram, Anusha

    Published 2007
    “…This system was developing base on to three main part which is data processing, testing and implementation of the algorithm. In this system a Bayesian algorithm was used in order to implement the system. …”
    Get full text
    Get full text
    Thesis