Search Results - (( ((data processing) OR (_ processing)) path algorithm ) OR ( java application based 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

    Automated path testing using the negative selection algorithm by Shayma Mustafa Mohi-Aldeen, Radziah Mohamad, Safaai Deris

    Published 2017
    “…Negative selection algorithm (NSA) has been used in this paper to generate test data for path testing automatically. …”
    Get full text
    Get full text
    Indexed Article
  3. 3

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

    Published 2019
    “…This implementation of graph traversal, statistics and machine learning algorithms were a challenging part to be done. Input will be taken as an image and the process of converting the image to become a function by graph-based data methods have been taken as the important points to succeed this project by using the Image Processing Toolbox in MATLAB. …”
    Get full text
    Get full text
    Final Year Project
  4. 4

    Railway shortest path planner application using ant colony optimization algorithm / Muhammad Hassan Firdaus Ruslan by Ruslan, Muhammad Hassan Firdaus

    Published 2017
    “…For the process module, Ant Colony Optimization (ACO) algorithm was used to find the shortest path. …”
    Get full text
    Get full text
    Thesis
  5. 5
  6. 6

    Development Of Generative Computer-Aided Process Planning System For Lathe Machining by Zubair, Ahmad Faiz

    Published 2019
    “…Therefore, a single automatic system that able to transfer CAD data into machining readable data through CAM data had been developed.…”
    Get full text
    Get full text
    Thesis
  7. 7

    Vision-based robot indoor navigation by Teo, Zhin Hang

    Published 2022
    “…NodeRed links both processing units together. An algorithm is developed in the computer to achieve image processing, user input, path planning, simulation, and writing of output files. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
  8. 8
  9. 9

    A Continuous Overlay Path Probing Algorithm For Overlay Networks by Feily, Maryam

    Published 2013
    “…Several experiments were carried out using the OMNeT++ simulation framework. The designed algorithm was evaluated using experimental data. The obtained results show that the continuous in-band overlay path probing algorithm (COPPA) provides up-to-date bandwidth information with reduced overhead and minimal impact on the traffic of the path.…”
    Get full text
    Get full text
    Thesis
  10. 10

    A generalized laser simulator algorithm for optimal path planning in constraints environment by Aisha, Muhammad

    Published 2022
    “…The local maps were built using data from live video streaming s by real-time image processing to detect the segments of the lab and road environments. …”
    Get full text
    Thesis
  11. 11

    Two Phase Shortest Path Algorithm for Non-Negative Undirected Graphs by Qureshi, MA., Hassan, M.F., Safdar, S., Akhbar, R.

    Published 2010
    “…As nodes are being traversed in BFS fashion with few violations and additions promising a O(k(|V| + |E|)) time algorithm where 0<k<log n. More over this algorithm does not need any complex data structure.…”
    Get full text
    Get full text
    Conference or Workshop Item
  12. 12

    Micro-sequencer based control unit design for a central processing unit by Tan, Chang Hai

    Published 2007
    “…Register transfer logic (RTL) level design methodology namely top level RTL architecture, RTL control algorithm, data path unit design, RTL control sequence table, microsequencer control unit design, integration of control unit and data path unit, and the functional simulation for the design verification are included in this research.…”
    Get full text
    Get full text
    Get full text
    Thesis
  13. 13

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

    Published 2015
    “…This research aims to assist the evacuees to find the shortest path in a high rise building using a shortest path algorithm. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  14. 14

    An application of Floyd-Warshall Algortihm in finding shortest path of order picker in warehouse / Saidatul Aisyah Roslan, Siti Norhakimah Mohd Yatim and Siti Sarah Sulaiman by Roslan, Saidatul Aisyah, Mohd Yatim, Siti Norhakimah, Sulaiman, Siti Sarah

    Published 2019
    “…For the result, shortest path for the order pickers in iterations. The algorithm used can help the order picker to have the shortest path, but it have no direct path. …”
    Get full text
    Get full text
    Student Project
  15. 15
  16. 16

    Performance Analysis of Swarm Intelligence-Based Routing Protocol for Mobile Ad Hoc Network and Wireless Mesh Networks by Moghanjoughi, Ayyoub Akbari

    Published 2009
    “…Also the main aim of this research is to solve the freezing problem during optimum as well as sub-optimum path discovery process. In this research, Intelligent AntNet based Routing Algorithm (IANRA) is presented for routing in WMNs and MANET to find optimum and near-optimum paths for data packet routing. …”
    Get full text
    Get full text
    Thesis
  17. 17
  18. 18

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