Search Results - (( java implementation path algorithm ) OR ( using minimum tree algorithm ))

Search alternatives:

Refine Results
  1. 1
    Outlier detection in circular regression model using minimum spanning tree method

    Outlier detection in circular regression model using minimum spanning tree method by Nur Faraidah, Muhammad Di, Siti Zanariah, Satari, Roslinazairimah, Zakaria

    Published 2019
    “…Therefore, this study aims to develop new algorithms that can detect outliers by using the minimum spanning tree method. …”
    Get full text
    Get full text
    Conference or Workshop Item
    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
    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:
  4. 4
    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:
  5. 5
    Some greedy based algorithms for multi periods degree constrained minimum spanning tree problem

    Some greedy based algorithms for multi periods degree constrained minimum spanning tree problem by Wamiliana, Wamiliana, Elfaki, Faiz Ahmed Mohamed, Usman, Mustofa, Azram, Mohammad

    Published 2015
    “…In this paper we proposed three algorithms by modifying Kruskal’s and Prim’s algorithms. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  6. 6
    Synthesis of transistor-chaining algorithm for CMOS cell layout using bipartite graph / Azizi Misnan

    Synthesis of transistor-chaining algorithm for CMOS cell layout using bipartite graph / Azizi Misnan by Misnan, Azizi

    Published 1997
    “…The result will be compared with euler's path algorithm using heuristic search and a pseudo input to find the minimum interlace.…”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  7. 7
    A matrix approach for minimum spanning tree in neutrosophic and application in medical waste management / Nur Haifa Ahmad Hayazim, Siti Nurain Zulkifli and Siti Nurhidayah Yaacob

    A matrix approach for minimum spanning tree in neutrosophic and application in medical waste management / Nur Haifa Ahmad Hayazim, Siti Nurain Zulkifli and Siti Nurhidayah Yaacob by Ahmad Hayazim, Nur Haifa, Zulkifli, Siti Nurain, Yaacob, Siti Nurhidayah

    Published 2022
    “…A numerical example related to finding the optimal route that can minimize the cost of solving the medical waste management is provided to show the effectiveness of the Prim's and Kruskal's algorithms with IVBN. As a final step, a comparative study such as interval-valued neutrosophic minimum spanning tree (IVN-MST), interval-valued intuitionistic fuzzy minimum spanning tree (IVIF-MST) and interval-valued fuzzy minimum spanning tree (IVE-MST) is presented to point out the advantages of the proposed method over that of other existing algorithms. …”
    Get full text
    Get full text
    Student Project
    Save to List
    Saved in:
  8. 8
    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:
  9. 9
    Synthesis of transistor chaining algorithm for CMOS cell layout using bipartite graph / Azizi Misnan

    Synthesis of transistor chaining algorithm for CMOS cell layout using bipartite graph / Azizi Misnan by Misnan, Azizi

    Published 1997
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  10. 10
    A genetic algorithm approach to VLSI macro cell non-slicing floorplans using binary tree

    A genetic algorithm approach to VLSI macro cell non-slicing floorplans using binary tree by Rahim At Samsuddin, H. A., Ab. Rahman, A. A. H., Andaljayalakshmi, G., Ahmad, R. B.

    Published 2008
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  11. 11
    Outlier detection in circular regression model using minimum spanning tree method

    Outlier detection in circular regression model using minimum spanning tree method by Nur Faraidah, Muhammad Di, Siti Zanariah, Satari, Roslinazairimah, Zakaria

    Published 2019
    “…Therefore, this study aims to develop new algorithms that can detect outliers by using minimum spanning tree method. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  12. 12
    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:
  13. 13
    Classification of tropical rainforest using different classification algorithm based on remote sensing imagery: A study of Gunung Basor

    Classification of tropical rainforest using different classification algorithm based on remote sensing imagery: A study of Gunung Basor by Intan Noradybah Md Rodi

    Published 2019
    “…Three different classification algorithm, minimum distance classifier, Mahalanobis distance classifier and maximum likelihood algorithm was applied to classify the forest area in Gunung Basor. …”
    Get full text
    Get full text
    Undergraduate Final Project Report
    Save to List
    Saved in:
  14. 14
    Winsorize tree algorithm for handling outliers in classification problem

    Winsorize tree algorithm for handling outliers in classification problem by Ch’ng, Chee Keong

    Published 2016
    “…This study proposes a modified classification tree algorithm called Winsorize tree based on the distribution of classes in the training dataset. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  15. 15
    A minimum spanning tree stock market analysis of Malaysia technology companies

    A minimum spanning tree stock market analysis of Malaysia technology companies by Zulrushdi, Puteri Nur Qistina Megat, Bahaludin, Hafizah, Ibrahim, Siti Nur Iqmal

    Published 2024
    “…The collected data is the daily closing prices of Malaysia’s top 20 most active companies based on the volume traded in the list of technology companies. The minimum spanning tree was used to construct the network via Kruskal’s algorithm, and the centrality measures of the stocks, such as degree, betweenness, closeness, and eigenvector, were measured to identify influential stocks. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  16. 16
    A genetic algorithm approach to VLSI macro cell non-slicing floorplans using binary tree

    A genetic algorithm approach to VLSI macro cell non-slicing floorplans using binary tree by Hasliza, A. Rahim@Samsuddin, Ab Rahman, A. A H, Andaljayalakshmi, G., R. Badlishah, Ahmad, Wan Nur Suryani Firuz, Wan Ariffin

    Published 2009
    Get full text
    Article
    Save to List
    Saved in:
  17. 17
    A genetic algorithm approach to VLSI macro cell non-slicing floorplans using binary tree

    A genetic algorithm approach to VLSI macro cell non-slicing floorplans using binary tree by Hasliza, A. Rahim@Samsuddin, Ab Al-Hadi, Ab Rahman, Andaljayalakshmi, G., R. Badlishah, Ahmad, Wan Nur Suryani Firuz, Wan Arrifin

    Published 2009
    Get full text
    Working Paper
    Save to List
    Saved in:
  18. 18
    Using modification of Prim's algorithm and GNU Octave and to solve the multiperiods installation problem

    Using modification of Prim's algorithm and GNU Octave and to solve the multiperiods installation problem by ,, Wamiliana, Usman, Mustofa, ,, Warsono, Daoud, Jamal Ibrahim

    Published 2020
    “…The Minimum Spanning Tree (MST) is one of the famous problems that is used mostly as the backbone in many network design problems. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  19. 19
    Optimized routing algorithm for mobile multicast source in Wireless Mesh Networks

    Optimized routing algorithm for mobile multicast source in Wireless Mesh Networks by Sanni, Mistura Laide, Hassan Abdalla Hashim, Aisha, Hassan, Wan Haslina, Anwar, Farhat, Ahmed, Gharib Subhi Mahmoud

    Published 2015
    “…Simulation results show that the proposed algorithm converges and outperforms a source based tree algorithm. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Proceeding Paper
    Save to List
    Saved in:
  20. 20
    An Efficient Data Structure for General Tree-Like Framework in Mining Sequential Patterns Using MEMISP

    An Efficient Data Structure for General Tree-Like Framework in Mining Sequential Patterns Using MEMISP by Saputra, Dhany, Rambli, Dayang R.A., Foong, Oi Mean

    Published 2007
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:

Search Tools: