Search Results - (( process using ((graph algorithm) OR (path algorithm)) ) OR ( java application using algorithm ))

Refine Results
  1. 1

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

    Published 2007
    “…This thesis proposes a graph processing hardware accelerator for shortest path algorithms applied in nanometer VLSI interconnect routing problems. …”
    Get full text
    Get full text
    Get full text
    Thesis
  2. 2
  3. 3

    FROM IMAGE TO GRAPH-BASED DATA FOR PATH PLANNING by MOHAMAD YATIM, NOOR AMANINA HANISAH

    Published 2019
    “…There’s varies approach to be used for path planning and one of the approaches that will be discuss in this report which is a study of graph-based data from an image of a maze-solving path project. …”
    Get full text
    Get full text
    Final Year Project
  4. 4

    Ant colony optimization algorithm for load balancing in grid computing by Ku-Mahamud, Ku Ruhana, Mohamed Din, Aniza

    Published 2012
    “…The resource allocation problem is modelled as a graph that can be used by the ant to deliver its pheromone.This graph consists of four types of vertices which are job, requirement, resource and capacity that are used in constructing the grid resource management element. …”
    Get full text
    Get full text
    Get full text
    Monograph
  5. 5

    Enhancement of Ant Colony Optimization for Grid Job Scheduling and Load Balancing by Husna, Jamal Abdul Nasir

    Published 2011
    “…A simulation environment was developed using Java programming to test the performance of the proposed EACO algorithm against existing grid resource management algorithms such as Antz algorithm, Particle Swarm Optimization algorithm, Space Shared algorithm and Time Shared algorithm, in terms of processing time and resource utilization. …”
    Get full text
    Get full text
    Get full text
    Thesis
  6. 6

    Frequent itemset mining using graph theory / Mohammad Arsyad Mohd Yakop by Mohd Yakop, Mohammad Arsyad

    Published 2017
    “…Designing the FRG-Closed involves new data structure creation known as Frequent Row Graph or FR-Graph. The searching process in the FR-Graph involves the construction of two methods: getPath and item-merging. …”
    Get full text
    Get full text
    Thesis
  7. 7

    High Rise Building Evacuation Route Model Using DIJKSTRA'S Algorithm by Mohd Sabri, Nor Amalina

    Published 2015
    “…The information then is used to generate a directed graph in order to obtain the shortest path results through the implementation of shortest path algorithm. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  8. 8

    Resource management in grid computing using ant colony optimization by Ku-Mahamud, Ku Ruhana, Mohamed Din, Aniza

    Published 2011
    “…Resources with high pheromone value are selected to process the submitted jobs.Global pheromone update is performed after completion processing the jobs in order to reduce the pheromone value of resources.A simulation environment was developed using Java programming to test the performance of the proposed EACO algorithm against other ant based algorithm, in terms of resource utilization.Experimental results show that EACO produced better grid resource management solution.…”
    Get full text
    Get full text
    Get full text
    Get full text
    Monograph
  9. 9

    Using graph algorithm and classification technique for finding an optimal bus route in time-dependent travel times by Deelertmongkolchai, Satjayod, Chumwatana, Todsanai, Thaiupathump, Choonhapong

    Published 2016
    “…The proposed technique is able to find a least spent travel time path between two nodes in a bus network with time-dependence.Graph algorithm is used to generate all possible paths to reveal the distances.Classification technique is then used to analysis traffic situation in different period of the time.By analysis traffic situation, date, time, week, month, location are used as a main factor for training process in classification technique.From the experimental studies, the proposed technique is able to show the best route from any given node to the final destination depending on the different period of the time.The proposed technique provides significant benefit for traveler to select the best bus route, which is short distance and fast, among generated routes…”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  10. 10

    Design and analysis of construction and recombination module using Idury Waterman Algorithm for fragment assembly application / Hafifi Mohd Rafi by Mohd Rafi, Hafifi

    Published 2012
    “…Combination of Eulerian path and de Bruijn graph concept will guide the overlaps process between the DNA sequences. …”
    Get full text
    Get full text
    Thesis
  11. 11

    Implementation of laser simulator in robot path determination by Zenas, Chung Han Yuan

    Published 2016
    “…In addition, one of the classical path planning approach which is A* algorithm will be used to compare the result generated by laser simulator. …”
    Get full text
    Get full text
    Undergraduates Project Papers
  12. 12

    Quantum Processing Framework And Hybrid Algorithms For Routing Problems by Soltan Aghaei, Mohammad Reza

    Published 2010
    “…A typical component in QPU is a quantum device that runs quantum algorithms; namely Quantum Algorithm Processing Unit (QAPU). …”
    Get full text
    Get full text
    Thesis
  13. 13

    Investigating and developing the best method in shortest path for implementing a geographical information system (e-map) for Peninsular Malaysia by Ahmad, Ab. Rahman, Zenon , Nasaruddin, Hassan, Haswadi

    Published 2005
    “…There are many algorithms have been designed to find these paths. The algorithms such as Djikstra, Bellman-Ford or Floyd- Warshall are difference from one to another due to the simplicity, effectiveness and duration of processing the nodes. …”
    Get full text
    Get full text
    Monograph
  14. 14

    Global Mobile Robot Path Planning using Laser Simulator by Ali, Mohammed A. H., Wan Azhar, Wan Yusoff, Zamzuri, Hamedon, Zulkifli, Md. Yusof, Musa, Mailah

    Published 2017
    “…This paper presents the utilization of novel laser simulator search graph approach for global path determination in unknown environment using MATLAB. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  15. 15

    Modeling and querying alternative paths in Kuantan by Mohamad Salleh, Mazlina

    Published 2007
    “…The graph theory algorithm used in this study is applied from the Floyd’s approach and using the combination of searching techniques of breadth first search (BFS) and depth first search (DFS) strategies. …”
    Get full text
    Get full text
    Get full text
    Thesis
  16. 16

    Design of DNA fragment assembly using IWP method on application-specific integrated-circuit / Hasniliati Hassan by Hassan, Hasniliati

    Published 2017
    “…After reviewing various algorithms, it was decided to apply de Bruijn graphs and Eulerian circuits that are based on graph theory. …”
    Get full text
    Get full text
    Thesis
  17. 17

    A test case generation framework based on UML statechart diagram by Salman, Yasir Dawood

    Published 2018
    “…Unfortunately, existing studies in this domain are not sufficiently comprehensive in describing the major processes of the automated test case generation. Furthermore, the algorithms used for test case generation are not provided or well described. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  18. 18

    Effect of LiDAR mounting parameters and speed on HDL graph SLAM-Based 3D mapping for autonomous vehicles by Law, Jia Seng, Muhammad Aizzat, Zakaria, Younus, Maryam, Yong, Ericsson, Ismayuzri, Ishak, Mohamad Heerwan, Peeie, Muhammad Izhar, Ishak

    Published 2025
    “…This study investigates the physical calibration of a LiDAR sensor mounted on a moving vehicle and its effect on 3D map generation using the HDL Graph SLAM algorithm. HDL Graph SLAM was selected as the offline post-processing method due to its self-correcting functions for estimating and auto-correcting positional errors from LiDAR data. …”
    Get full text
    Get full text
    Get full text
    Article
  19. 19
  20. 20

    Graph coloring program of exam scheduling modeling based on bitwise coloring algorithm using python by Arifin, Samsul, Muktyas, Indra Bayu, Al Maki, Wikky Fawwaz, Mohd Khairul Bazli, Mohd Aziz

    Published 2022
    “…The researchers develop a graph coloring algorithm by considering some of the graph vertices to be binary numbers. …”
    Get full text
    Get full text
    Get full text
    Article