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

Search alternatives:

  • Showing 1 - 18 results of 18
Refine Results
  1. 1
    Stereo Matching Algorithm Based On Per Pixel Difference Adjustment, Iterative Guided Filter And Graph Segmentation

    Stereo Matching Algorithm Based On Per Pixel Difference Adjustment, Iterative Guided Filter And Graph Segmentation by Hamzah, Rostam Affendi, Ibrahim, Haidi, Abu Hassan, Anwar Hasni

    Published 2017
    “…The undirected graph segmentation is used at the last stage in order to smoothen the low textured areas. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  2. 2
    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:
  3. 3
    Graph-Based Algorithm With Self-Weighted And Adaptive Neighbours Learning For Multi-View Clustering

    Graph-Based Algorithm With Self-Weighted And Adaptive Neighbours Learning For Multi-View Clustering by He, Yanfang

    Published 2024
    “…To address the noise problem in multi-view data, this study enhances the gbs method and develops a new self-weighted graph multi-view clustering algorithm (swmcan). Particularly, swmcan addresses multi-view data noise using the l1-norm and optimizes the objective function through a novel iterative reweighted method. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  4. 4
    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:
  5. 5
    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:
  6. 6
    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:
  7. 7
    A maximal-clique-based clustering approach for multi-observer multi-view data by using k-nearest neighbor with S-pseudo-ultrametric induced by a fuzzy similarity

    A maximal-clique-based clustering approach for multi-observer multi-view data by using k-nearest neighbor with S-pseudo-ultrametric induced by a fuzzy similarity by Khameneh, Azadeh Zahedi, Ghaznavi, Mehrdad, Kilicman, Adem, Mahad, Zahari, Mardani, Abbas

    Published 2024
    “…The proposed clustering algorithm is programmed and tested on synthetic and four real-world datasets using the R software. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  8. 8
    Energy efficient path-planning for unmanned aerial vehicle

    Energy efficient path-planning for unmanned aerial vehicle by Debnath, Sanjoy Kumar

    Published 2022
    “…The proposed path planning algorithm is called Iterative Elliptical- Convex Visibility Graph (IECoVG) which is based on visibility graph (VG) and Dijkstra’s algorithm. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  9. 9
    Enhancement of network security by use machine learning

    Enhancement of network security by use machine learning by Hasan, Ahmed Raheem

    Published 2019
    “…The time taken to reach the accuracy is also short with less number of iteration. The ANNDL uses iterations method to detect the data, do matching and identify the data. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  10. 10
    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:
  11. 11
    Defects identification on semiconductor wafer for yield improvement using machine learning / Pedram Tabatabaeemoshiri

    Defects identification on semiconductor wafer for yield improvement using machine learning / Pedram Tabatabaeemoshiri by Pedram , Tabatabaeemoshiri

    Published 2025
    “…This work presents a novel graph-based semi-supervised learning (GSSL) algorithm designed for wafer defect detection. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  12. 12
    Novel Adaptive Bacterial Foraging Algorithms for Global Optimisation with Application to Modelling of a TRS

    Novel Adaptive Bacterial Foraging Algorithms for Global Optimisation with Application to Modelling of a TRS by Ahmad Nor Kasruddin, Nasir, Nor Maniha, Abd Ghani, Tokhi, M. O.

    Published 2015
    “…The constant step size in the original bacterial foraging algorithm causes oscillation in the convergence graph where bacteria are not able to reach the optimum location with large step size, hence reducing the accuracy of the final solution. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  13. 13
    Local-based stereo matching algorithm using multi-cost pyramid fusion, hybrid random aggregation and hierarchical cluster-edge refinement

    Local-based stereo matching algorithm using multi-cost pyramid fusion, hybrid random aggregation and hierarchical cluster-edge refinement by Kadmin, Ahmad Fauzan

    Published 2023
    “…In this thesis, the accuracy of the proposed algorithm was evaluated using two standard online benchmarking database systems. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  14. 14
    A comparative study of interactive segmentation with different number of strokes on complex images

    A comparative study of interactive segmentation with different number of strokes on complex images by Kok, Luong Goh, Giap, Weng Ng, Muzaffar Hamzah, Soo, See Chai

    Published 2020
    “…The most common user input type in interactive segmentation is using strokes. The different number of strokes are utilized in each different interactive segmentation algorithms. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  15. 15
    A Comparative Study of Interactive Segmentation with Different Number of Strokes on Complex Images

    A Comparative Study of Interactive Segmentation with Different Number of Strokes on Complex Images by Goh, Kok Luong, Ng, Giap Weng, Muzaffar, Hamzah, Chai, Soo See

    Published 2020
    “…The most common user input type in interactive segmentation is using strokes. The different number of strokes are utilized in each different interactive segmentation algorithms. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  16. 16
    Modification of particle swarm optimization algorithm for optimization of discrete values

    Modification of particle swarm optimization algorithm for optimization of discrete values by Mohd Yassin, Ahmad Ihsan, Jusoh, Muhammad Huzaimy, Abdul Rahman, Farah Yasmin

    Published 2011
    “…Discrete optimization has been used to solve various real-life problems, such as job-shop scheduling, vehicle routing, sequential ordering, graph colouring, and shortest common super sequence [4). …”
    Get full text
    Get full text
    Research Reports
    Save to List
    Saved in:
  17. 17
    Addressing examination timetabling problem using a partial exams approach in constructive and improvement

    Addressing examination timetabling problem using a partial exams approach in constructive and improvement by Mandal, Ashis Kumar, Kahar, M. N. M., Kendall, Graham

    Published 2020
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  18. 18
    Evolutionary cost-cognizant regression test case prioritization for object-oriented programs

    Evolutionary cost-cognizant regression test case prioritization for object-oriented programs by Bello, AbdulKarim

    Published 2019
    “…Therefore, this study proposed a cost-cognizant TCP approach for object-oriented software that uses path-based integration testing to identify the possible execution path extracted from the Java System Dependence Graph (JSDG) model of the source code using forward slicing technique. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:

Search Tools: