Search Results - (( java implementation clustering algorithm ) OR ( causing problems path algorithm ))

Search alternatives:

Refine Results
  1. 1
    Web-based clustering tool using fuzzy k-mean algorithm / Ahmad Zuladzlan Zulkifly

    Web-based clustering tool using fuzzy k-mean algorithm / Ahmad Zuladzlan Zulkifly by Zulkifly, Ahmad Zuladzlan

    Published 2019
    “…This project will use fuzzy k-means clustering algorithm to cluster the data because it is easy to implement and have many advantages. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  2. 2
    Image clustering comparison of two color segmentation techniques

    Image clustering comparison of two color segmentation techniques by Subramaniam, Kavitha Pichaiyan

    Published 2010
    “…The clustering research is regarding the area of data mining and implementation of the clustering algorithms. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  3. 3
    A Toolkit for Simulation of Desktop Grid Environment

    A Toolkit for Simulation of Desktop Grid Environment by FOROUSHAN, PAYAM CHINI

    Published 2014
    “…A simulator for desktop grid environment has been developed using Java as the implementation language due to its wide popularity. …”
    Get full text
    Get full text
    Final Year Project
    Save to List
    Saved in:
  4. 4
    Shortest path from Bandar Tun Razak to Berjaya Times Square using Dijkstra Algorithm / Nur Syuhada Muhammat Pazil ... [et al.]

    Shortest path from Bandar Tun Razak to Berjaya Times Square using Dijkstra Algorithm / Nur Syuhada Muhammat Pazil ... [et al.] by Muhammat Pazil, Nur Syuhada, Mahmud, Norwaziah, Jamaluddin, Siti Hafawati, Mustafa, Nur Farasyaqirra

    Published 2020
    “…The time of the shortest path problem and the cost problem are drawn separately. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  5. 5
    Restaurant locator using Djikstra Algorithm / Mohamad Aliff Hakimi Lukman Hakim

    Restaurant locator using Djikstra Algorithm / Mohamad Aliff Hakimi Lukman Hakim by Lukman Hakim, Mohamad Aliff Hakimi

    Published 2017
    “…In network theory, it’s known as the shortest-path problem, and Dijkstra’s algorithm is usually used to solve it. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  6. 6
    Enhancing Performance of Batik SMEs through Cleaner Production Adoption: Insights from Clustering Algorithm Analysis

    Enhancing Performance of Batik SMEs through Cleaner Production Adoption: Insights from Clustering Algorithm Analysis by Achmad, Fandi, Zulkarnain, Ibnu, Rumanti, Augustina Asih, Wiratmadja, Iwan Inrawan, Shuhidan, Shuhaida Mohamed

    Published 2025
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  7. 7
    A web-based implementation of k-means algorithms

    A web-based implementation of k-means algorithms by Lee, Quan

    Published 2022
    “…Firstly, k-luster could incorporate additional clustering algorithms, or even classification algorithms in the future. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
    Save to List
    Saved in:
  8. 8
    Ant colony optimization (ACO) algorithm for CNC route problem

    Ant colony optimization (ACO) algorithm for CNC route problem by Wan Nur Farhanah , Wan Zakaria

    Published 2012
    “…This project is about to develop a software which applying ACO algorithm in order to calculate the shortest path available that can reduce the time taken to drill the entire hole of PCB. …”
    Get full text
    Get full text
    Undergraduates Project Papers
    Save to List
    Saved in:
  9. 9
    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 existing Smith-Waterman algorithm had complex memory and low performance where the time also was consumed caused by high sensitivity of the large sequences long. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  10. 10
    An improved narrowband active noise control system without secondary path modelling based on the time domain

    An improved narrowband active noise control system without secondary path modelling based on the time domain by Mondal, Kuheli, Das, Saurav, Hamada, Nozomu, Haji Abu, Aminudin, Das, Saikat, Faris, Waleed Fekry, Toh, Hoong Thiam, Ahmad, Akij

    Published 2019
    “…Several secondary path, acoustic noise cancellation modelling causes the problems to increase the complexity of ANC implementation, reduction of performance caused by modelling error and requirement of auxiliary noise for secondary path modelling. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  11. 11
    Optimizing optimal path trace back system for Smith-Waterman algorithm using structural modelling technique: article

    Optimizing optimal path trace back system for Smith-Waterman algorithm using structural modelling technique: article by Saliman, Nur Farah Ain

    Published 2012
    “…Due to the increasing number of the population, it also affected the increases number of probability in Deoxyribonucleic Acid (DNA) sequences alignment. This will cause disadvantages in the performance and speed level of the Smith-Waterman Algorithm. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  12. 12
    Application-Programming Interface (API) for Song Recognition Systems

    Application-Programming Interface (API) for Song Recognition Systems by Murtadha Arif Sahbudin, Chakib Chaouch, Salvatore Serrano

    Published 2024
    Article
    Save to List
    Saved in:
  13. 13
    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 existing Smith-Waterman algorithm had complex memory and low performance where the time also was consumed caused by high sensitivity of the large sequences long. …”
    Get full text
    Get full text
    Student Project
    Save to List
    Saved in:
  14. 14
    Performance of Ad-Hoc on-Demand Distance Vector Discovery Algorithms Based On Packet Lifetime

    Performance of Ad-Hoc on-Demand Distance Vector Discovery Algorithms Based On Packet Lifetime by Ahmad, Noor Azlan

    Published 2008
    “…The combination metrics of the lifetime and the sequence number in the table entry is used to solve the problem of the discarded active path information when the lifetime is expired. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  15. 15
    Mathematical simulation for 3-dimensional temperature visualization on open source-based grid computing platform

    Mathematical simulation for 3-dimensional temperature visualization on open source-based grid computing platform by Alias, Norma, Satam, Noriza, Abd. Ghaffar, Zarith Safiza, Darwis, Roziha, Hamzah, Norhafiza, Islam, Md. Rajibul

    Published 2009
    “…The development of this architecture is based on several programming language as it involves algorithm implementation on C, parallelization using Parallel Virtual Machine (PVM) and Java for web services development. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  16. 16
    Development of robust control scheme for wheeled mobile robot in restricted environment

    Development of robust control scheme for wheeled mobile robot in restricted environment by Muhammad Sawal, A Radzak

    Published 2021
    “…The control of MWR in the restricted areas during path execution still a complicated problem in robot researches, since it needs to maintain the tracking errors at the zero level and the wheel mobile robot must follow robustly the pre-defined path using a suitable control system; otherwise it can cause to crash robot with other objects. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  17. 17
    Efficient flow-based channel assignment schemes for congestion avoidance in wireless mesh networks

    Efficient flow-based channel assignment schemes for congestion avoidance in wireless mesh networks by Abdulla Mogaibel, Hassen Abd-Almotaleb

    Published 2016
    “…Next, AODV-MRCR is extended to address the problems of throughput limitation and reduction which are caused by channel assignment overhead, interference caused by hidden nodes, and link congestion at the critical links in WMN. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  18. 18
    Adaptive Algorithm for Optimal Route Configuration in Multi-Hop Wireless Sensor Network

    Adaptive Algorithm for Optimal Route Configuration in Multi-Hop Wireless Sensor Network by Shabani, Hikma, Ahmed Mohamed, Ahmed Haidar, Norhuzaimin, Julai, Musse, Mohamud Ahmed, Hoole, P.R.P., Marai, Majdi

    Published 2017
    “…To gather relevant data, the route optimization mechanism is used to solve the long routing problem and provide the shortest path amongst communicating nodes. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  19. 19
    Real-Time Optimal Trajectory Correction (ROTC) for autonomous quadrotor / Noorfadzli Abdul Razak

    Real-Time Optimal Trajectory Correction (ROTC) for autonomous quadrotor / Noorfadzli Abdul Razak by Abdul Razak, Noorfadzli

    Published 2018
    “…Integrating a trajectory correction algorithm in the navigation control can overcome this problem. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  20. 20
    Robot path planning using family of SOR iterative methods with laplacian behaviour-based control

    Robot path planning using family of SOR iterative methods with laplacian behaviour-based control by Azali Saudi

    Published 2015
    “…In addition, the newly proposed LBBC overcomes the drawback of the existing GDS that face difficulty when handling complex environment. Finally, the path planning problem is solved by combining the fast iterative method with the robust path searching LBBC technique, so that the path planning algorithm is capable of handling large and complex environment.…”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:

Search Tools: