Search Results - (( java implementation using algorithm ) OR ( using graph ((data algorithm) OR (path algorithm)) ))

Search alternatives:

Refine Results
  1. 1
    Graph processing hardware accelerator for shortest path algorithms in nanometer very large-scale integration interconnect routing

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

    Published 2007
    “…Graphs are pervasive data structures in computer science, and algorithms working with them are fundamental to the field. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  2. 2
    A hybrid algorithm for finding shortest path in network routing.

    A hybrid algorithm for finding shortest path in network routing. by Soltan Aghaei, Mohammad Reza, Ahmad Zulkarnain, Zuriati, Mamat, Ali, Zainuddin, Hishamuddin

    Published 2009
    “…This wave gives an O( N ) steps quantum algorithm for identifying that record, where was used classical Dijkstra’s algorithm for finding shortest path problem in the graph of network and implement quantum search. …”
    Get full text
    Article
    Save to List
    Saved in:
  3. 3
    FROM IMAGE TO GRAPH-BASED DATA FOR PATH PLANNING

    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
    Save to List
    Saved in:
  4. 4
    An Experiment of Ant Algorithms : Case Study of Kota Kinabalu Central Town

    An Experiment of Ant Algorithms : Case Study of Kota Kinabalu Central Town by Nor Rafidah, Mohamad

    Published 2005
    “…There are many algorithms that used to solve this problem. In this study, ant algorithms are used to find the shortest path using a real data. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  5. 5
    Frequent itemset mining using graph theory / Mohammad Arsyad Mohd Yakop

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

    Published 2017
    “…The Directed Acyclic Graph in High Dimensional Dataset Mining (DAGHDDM) is a graph-based mining algorithm that represents itemsets in complete graph before FIM takes place. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  6. 6
    High Rise Building Evacuation Route Model Using DIJKSTRA'S Algorithm

    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
    Save to List
    Saved in:
  7. 7
    Using graph algorithm and classification technique for finding an optimal bus route in time-dependent travel times

    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
    “…However, they are suffering from the long hours in traffic jam especially in rush hour.They also cannot avoid this such jam as bus routes are fixed by Bangkok Mass Transit Authority (BMTA).This paper aims to propose a technique for finding an Optimal Bus Route in Time-Dependent Travel Times by using graph algorithm and data mining technique. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  8. 8
    Investigating and developing the best method in shortest path for implementing a geographical information system (e-map) for Peninsular Malaysia

    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
    “…Assessment will be done by calculating the algorithm complexion and runtime using the computer. …”
    Get full text
    Get full text
    Monograph
    Save to List
    Saved in:
  9. 9
    Modeling and querying alternative paths in Kuantan

    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
    Save to List
    Saved in:
  10. 10
    Design and development of optimal path trace back using graph theory technique for accelerate DNA sequence alignment accelerator: article

    Design and development of optimal path trace back using graph theory technique for accelerate DNA sequence alignment accelerator: article by Othman, Nor Shuhaida

    Published 2010
    “…The scope of the paper based on optimal path trace back using graph theory. The kind of graph theory that been used was indirected graph with linear algebra. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  11. 11
    Design of DNA fragment assembly using IWP method on application-specific integrated-circuit / Hasniliati Hassan

    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
    Save to List
    Saved in:
  12. 12
    Design and development of optimal path trace back using graph theory technique for accelerate DNA sequence alignment accelerator

    Design and development of optimal path trace back using graph theory technique for accelerate DNA sequence alignment accelerator by Othman, Nor Shuhaida

    Published 2010
    “…The scope of the paper based on optimal path trace back using graph theory. The kind of graph theory that been used was indirected graph with linear algebra. …”
    Get full text
    Get full text
    Student Project
    Save to List
    Saved in:
  13. 13
    Implementation of Graph Based Path Planning Algorithms on a Mobile Robot in a Confined Site

    Implementation of Graph Based Path Planning Algorithms on a Mobile Robot in a Confined Site by TANG, HON PANN

    Published 2017
    “…This project investigates the performance of three different graph based path planning algorithms used, relaxed A*, A* and Dijkstra’s algorithm in a few environments with different obstacles settings using Gazebo environment simulator and Turtlebot simulator (computer simulation) and 4WD navigation robot (real environment simulation).…”
    Get full text
    Get full text
    Final Year Project
    Save to List
    Saved in:
  14. 14
    Attack graph construction for enhancing intrusion prediction based on vulnerabilities metrics

    Attack graph construction for enhancing intrusion prediction based on vulnerabilities metrics by Al-Araji, Zaid Jasim Mohammed

    Published 2023
    “…The attack graph is categorized into three sections: generation, analysis, and use of attack graph. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  15. 15
    A Study of Visual Attention in Diagnosing Cerebellar Tumours

    A Study of Visual Attention in Diagnosing Cerebellar Tumours by Kuryati, Kipli, Kasumawati, Lias, Dayang Azra, Awang Mat, Othman, A.K., Ade Syaheda Wani, Marzuki, Zamhari, N.

    Published 2009
    “…The status of each MRS is verified by using decision algorithm. Analysis involves determination of humans’s eye movement pattern in measuring the peak of spectrograms, scan path and determining the relationship of distributions of fixation durations with the accuracy of measurement. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  16. 16
    Nano-scale VLSI clock routing module based on useful-skew tree algorithm

    Nano-scale VLSI clock routing module based on useful-skew tree algorithm by Eik Wee, Chew, Heng Sun, Ch'ng, Shaikh-Husin, Nasir, Hani, Mohamed Khalil

    Published 2006
    “…We implemented Useful-Skew Tree (UST) algorithm which is based on the deferred-merge embedding (DME) paradigm, as the clock layout synthesis engine. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  17. 17
    Path Optimization For Cooperative Multi-Head 3d Printing

    Path Optimization For Cooperative Multi-Head 3d Printing by Cheong, Kah Jun

    Published 2020
    “…The performance of the two proposed algorithms is compared against Cura, which is a commonly used software for generating the nozzle path. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
    Save to List
    Saved in:
  18. 18
    Laser simulator: a novel search graph-based path planning approach

    Laser simulator: a novel search graph-based path planning approach by Ali, Mohammed A. H., Musa, Mailah

    Published 2018
    “…A novel technique called laser simulator approach for visibility search graph-based path planning has been developed in this article to determine the optimum collision-free path in unknown environment. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  19. 19
    Computationally-efficient path planning algorithms in obstacle-rich environments based on visibility graph method

    Computationally-efficient path planning algorithms in obstacle-rich environments based on visibility graph method by Abdul Latip, Nor Badariyah

    Published 2018
    “…In order to address the high computation time, an improved VG called Iterative Equilateral Spaces Oriented Visibility Graph (IESOVG) has been developed by reducing the number of obstacles used for path planning. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  20. 20
    Attack prediction to enhance attack path discovery using improved attack graph

    Attack prediction to enhance attack path discovery using improved attack graph by Al-Araji, Zaid Jasim, Abdullah, Raihana Syahirah, Syed Ahmad, Sharifah Sakinah

    Published 2022
    “…For the attack graph analysis, the random forest algorithm was used to detect, predict, and dynamically ascertain the attack location in the network. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:

Search Tools: