Search Results - (( java implementation path algorithm ) OR ( software simulation based algorithm ))

Search alternatives:

Refine Results
  1. 1
    Heavy Transportation Shortest Route using Dijkstra’s algorithm (HETRO) / Nurul Aqilah Ahmad Nezer

    Heavy Transportation Shortest Route using Dijkstra’s algorithm (HETRO) / Nurul Aqilah Ahmad Nezer by Ahmad Nezer, Nurul Aqilah

    Published 2017
    “…The development tools used in developing this project is NetBeans by using Java for the implementation of the coding. The methodology that used for developing this system is the Dijkstra’s algorithm. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  2. 2
    Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization

    Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization by Mohammad Ata, Karimeh Ibrahim

    Published 2019
    “…BST inserts the nodes in the way that the Dijkstra’s can find the empty parking in fastest way. Dijkstra’s algorithm initials the paths to finding the shortest path while ACO optimizes the paths. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  3. 3
    Path planning for unmanned aerial vehicle (UAV) using rotated accelerated method in static outdoor environment

    Path planning for unmanned aerial vehicle (UAV) using rotated accelerated method in static outdoor environment by Shaliza Hayati A. Wahab, Nordin Saad, Azali Saudi, Ali Chekima

    Published 2021
    “…In this study, a fast iterative method known as Rotated Successive Over-Relaxation (RSOR) is introduced. The algorithm is implemented in a self-developed 2D Java tool, UAV Planner. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  4. 4
    Smart appointment organizer for mobile application / Mohd Syafiq Adam

    Smart appointment organizer for mobile application / Mohd Syafiq Adam by Adam, Mohd Syafiq

    Published 2009
    “…The main component of this prototype is the use of Dijkstra algorithm to compute the shortest path from source of appointment to the 6 points of destinations within UiTM Shah Alam. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  5. 5
    PSAT : a pairwise test data generation tool based on simulated annealing algorithm

    PSAT : a pairwise test data generation tool based on simulated annealing algorithm by Goh, Ghee Hau

    Published 2015
    “…This research is about the research on developing a Pairwise Test Data Generation Tool based on Simulated Annealing (SA) algorithm which named as PSAT. …”
    Get full text
    Get full text
    Undergraduates Project Papers
    Save to List
    Saved in:
  6. 6
    RISC-V instruction set extension on blockchain application

    RISC-V instruction set extension on blockchain application by Cheong , Kin Seng

    Published 2024
    “…Towards the end of the project, the algorithms would be executed in a base RISC-V core and an extended RISC-V core using simulation tools to perform performance analysis. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
    Save to List
    Saved in:
  7. 7
    Hybrid test redundancy reduction strategy based on global neighborhood algorithm and simulated annealing

    Hybrid test redundancy reduction strategy based on global neighborhood algorithm and simulated annealing by Kamal Z., Zamli, Norasyikin, Safieny, Fakhrud, Din

    Published 2018
    “…Given such prospects, this research explores a hybrid test redundancy reduction strategy based on Global Neighborhood Algorithm and Simulated Annealing, called GNA_SA. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  8. 8
    MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD

    MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD by ABDULLAH, H., LAW BOON HUI, C., ZAKARIA, M. S.

    Published 2023
    “…Based on the simulation, the Ant Colony algorithm method is, on average, 10.8% better than conventional methods in reducing machining time. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  9. 9
    MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD

    MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD by ABDULLAH, H., LAW BOON HUI, C., ZAKARIA, M. S.

    Published 2023
    “…Based on the simulation, the Ant Colony algorithm method is, on average, 10.8% better than conventional methods in reducing machining time. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  10. 10
    MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD

    MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD by ABDULLAH, H., LAW BOON HUI, C., ZAKARIA, M. S.

    Published 2023
    “…Based on the simulation, the Ant Colony algorithm method is, on average, 10.8% better than conventional methods in reducing machining time. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  11. 11
    MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD

    MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD by ABDULLAH, H., LAW BOON HUI, C., ZAKARIA, M. S.

    Published 2023
    “…Based on the simulation, the Ant Colony algorithm method is, on average, 10.8% better than conventional methods in reducing machining time. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  12. 12
    An experimental study of neighbourhood based metaheuristic algorithms for test case generation satisfying the modified condition / decision coverage criterion

    An experimental study of neighbourhood based metaheuristic algorithms for test case generation satisfying the modified condition / decision coverage criterion by Haque, Ariful

    Published 2018
    “…To generate test cases that satisfy MC/DC criterion, many researchers adopt neighborhood based meta-heuristics algorithms (including that of Simulated Annealing and Hill Climbing) as the problem itself is neighborhood based. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  13. 13
    Minimization of machining process sequence based on ant colony algorithm and conventional method

    Minimization of machining process sequence based on ant colony algorithm and conventional method by Abdullah, Haslina, Law, Boon Hui C., Zakaria, Mohamad Shukri

    Published 2023
    “…Based on the simulation, the Ant Colony algorithm method is, on average, 10.8% better than conventional methods in reducing machining time. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  14. 14
    MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD

    MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD by H. ABDULLAH, H. ABDULLAH, C. LAW BOON HUI, C. LAW BOON HUI, M. S. ZAKARIA, M. S. ZAKARIA

    Published 2023
    “…Based on the simulation, the Ant Colony algorithm method is, on average, 10.8% better than conventional methods in reducing machining time. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  15. 15
    MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD

    MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD by H. ABDULLAH, H. ABDULLAH, C. LAW BOON HUI, C. LAW BOON HUI, M. S. ZAKARIA, M. S. ZAKARIA

    Published 2023
    “…Based on the simulation, the Ant Colony algorithm method is, on average, 10.8% better than conventional methods in reducing machining time. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  16. 16
    MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD

    MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD by ABDULLAH, H., LAW BOON HUI, C., ZAKARIA, M. S.

    Published 2023
    “…Based on the simulation, the Ant Colony algorithm method is, on average, 10.8% better than conventional methods in reducing machining time. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  17. 17
    Development of Simulated Annealing Based Scheduling Algorithm for Two Machines Flow Shop Problem

    Development of Simulated Annealing Based Scheduling Algorithm for Two Machines Flow Shop Problem by M., Muziana, Kamal Z., Zamli

    Published 2015
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  18. 18
    Three phase induction motor coupled to DC motor in hybrid electric vehicle application

    Three phase induction motor coupled to DC motor in hybrid electric vehicle application by Zulkarnain, Lubis

    Published 2011
    “…A novel algorithm software mode observer based induction motor controller with on-line parameter adaptation is then presented. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  19. 19
    Cohesive token passing algorithm utilizing software agents

    Cohesive token passing algorithm utilizing software agents by Abdulrazzak, A. Fua’ad, Subramaniam, Shamala

    Published 2010
    “…The results acquired validated the improved results of the new software agent based implementation. The performance metrics studied were average delay and average buffer utilization. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  20. 20
    An event-driven simulation for highest urgency first (HUF) : a latency and modulation aware bandwidth allocation algorithm for WiMAX base stations.

    An event-driven simulation for highest urgency first (HUF) : a latency and modulation aware bandwidth allocation algorithm for WiMAX base stations. by Naghshbandi, Danial, Subramaniam, Shamala, Moghadam, Saeed Rahimi

    Published 2013
    “…This research has focused at developing a discrete-event simulator to implement bandwidth allocation algorithms for a WiMAX base station.The highest urgency first algorithm has been utilized as a benchmark deployment algorithm in order to provide: dynamic downlink/uplink adjustment and latency guarantee for real-time applications. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:

Search Tools: