Search Results - (( java implication based algorithm ) OR ( using complex ((graph algorithm) OR (path 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
    “…Results of the performance tests on the proposed hardware graph accelerator, graph computations are significantly improved in terms of algorithm complexity and execution speed.…”
    Get full text
    Get full text
    Get full text
    Thesis
  2. 2

    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
  3. 3

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

    Published 2023
    “…For this issue, this study proposes using intelligent agents to reduce the reachability time in calculating between the nodes and use the naïve approach prune algorithm to remove unnecessary edges, minimizing the attack graph's complexity. …”
    Get full text
    Get full text
    Get full text
    Thesis
  4. 4

    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
  5. 5

    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
  6. 6

    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
  7. 7

    Implement edge pruning to enhance attack graph generation using the naïve approach algorithm by Al-Araji, Zaid J., Mutlag, Ammar Awad, Syed Ahmad, Sharifah Sakinah

    Published 2024
    “…For this issue, this study proposes using the naïve approach prune algorithm and using Personal agents to reduce the reachability time in calculating between the nodes and to remove unnecessary edges, minimizing the attack graph’s complexity. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  8. 8

    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
    “…In order to overcome this limitation, this present study recommends the use of intelligent agents to reduce reachability time by calculating between the nodes, as well as using the A*prune algorithm to remove useless edges and reduce attack graph complexity. …”
    Get full text
    Get full text
    Get full text
    Article
  9. 9

    Attack path selection optimization with adaptive genetic algorithms by Abd Rahman, A.S., Zakaria, M.N., Masrom, S.

    Published 2016
    “…We describe our approach for implementing an optimized security assessment using Genetic Algorithm (GA). Because of the dynamic nature of an enterprise network, all security analysis tools devised for the network need to function in dynamic mode as well. …”
    Get full text
    Get full text
    Article
  10. 10

    Attack path selection optimization with adaptive genetic algorithms by Abd Rahman, A.S., Zakaria, M.N., Masrom, S.

    Published 2016
    “…We describe our approach for implementing an optimized security assessment using Genetic Algorithm (GA). Because of the dynamic nature of an enterprise network, all security analysis tools devised for the network need to function in dynamic mode as well. …”
    Get full text
    Get full text
    Article
  11. 11

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

    Published 2010
    “…The designed hybrid architecture and framework were tested using the above quantum algorithms and the existing quantum algorithms. …”
    Get full text
    Get full text
    Thesis
  12. 12

    An improved algorithm for channel allocation on direct sequence spread spectrum by Handrizal, M

    Published 2011
    “…Meanwhile between the VMA and Dsatur algorithm in the complex graph is equivalent to 18.1%.However,VMA and Welsh Powell algorithm is not compared in the complex graph since its drawback in terms of not fulfill the graph coloring concept.This is because there are two adjacent vertices have the same color.Overall, even there is no reduction for number of required channel among VMA,Dsatur algorithm and Welsh Powell algorithm in the simple graph,but the outstanding significant contribution of VMA since it has reduction in the complex graph.…”
    Get full text
    Get full text
    Thesis
  13. 13

    Path planning methods for autonomous vehicles at intersections: A review by Vinayak, Akhil, Muhammad Aizzat, Zakaria, Younus, Maryam, Mohamad Heerwan, Peeie, Muhammad Izhar, Ishak

    Published 2026
    “…This review paper presents a comprehensive analysis of major path-planning methods used in Autonomous Vehicle (AV) navigation at intersections, including graph-based, sampling-based, curve-based, optimization-based, and machine learning–based approaches, while also examining emerging AI-driven path planners to better understand their capabilities. …”
    Get full text
    Get full text
    Get full text
    Article
  14. 14

    Accelerating graph algorithms with priority queue processor by Heng Sun, Ch'ng, Eik Wee, Chew, Shaikh-Husin, Nasir, Hani, Mohamed Khalil

    Published 2006
    “…Of the various graph algorithms, techniques for searching a graph are the heart of graph algorithms. …”
    Get full text
    Get full text
    Article
  15. 15

    Unconstraint assignment problem : a molecular computing approach by Zuwairie, Ibrahim, Yusei, Tsuboi, Osamu, Ono, Marzuki, Khalid

    Published 2006
    “…On the other hand, for the computational phase, itis discovered that the complexity of the unconstraint assignment problem can be reduced to a path problem of a graph, and thepossibility to solve the unconstraint assignment problem by DNA computing approach is shown in detail.…”
    Get full text
    Get full text
    Article
  16. 16
  17. 17
  18. 18
  19. 19
  20. 20