Search Results - (( java optimization path algorithm ) OR ( program visualization clustering algorithm ))

  • Showing 1 - 13 results of 13
Refine Results
  1. 1

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

    SecPath: Energy efficient path reconstruction in wireless sensor network using iterative smoothing by Abd, Wamidh Jwdat

    Published 2019
    “…This work uses iterative smoothing algorithm to find an alternative path with less distance and energy consumption. …”
    Get full text
    Get full text
    Thesis
  4. 4

    Energy efficient path reconstruction in wireless sensor network using iPath by Hasan, Sazlinah, Abd, Wamidh Jwdat, Ariffin, Ahmad Alauddin

    Published 2019
    “…This work uses iterative boosting algorithm to find an alternative path with less distance and energy consumption. …”
    Get full text
    Get full text
    Get full text
    Article
  5. 5

    Visdom: Smart guide robot for visually impaired people by Lee, Zhen Ting

    Published 2025
    “…Core functionalities such as path planning, autonomous movement, voice feedback, and app-to-robot communication have been thoroughly tested and optimized. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
  6. 6

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

    Enhanced bibliographic data retrieval and visualization using query optimization and spectral centrality measure by Ramasamy, Chitra, Zolkepli, Maslina

    Published 2019
    “…This study proposing an enhance bibliographic data retrieval and visualization using hybrid clustering method consists of K-harmonic mean (KHM) and Spectral Algorithm and eigenvector centrality measure. …”
    Get full text
    Get full text
    Get full text
    Article
  8. 8
  9. 9
  10. 10

    Facilitating resource allocation decision through Bibliomining: the case of UTM's library / Md Razib Karno by Karno, Md Razib

    Published 2015
    “…The data mining technique was adopted to explore the relationship among statistically patterned and clustered bibliographic data. Bibliomining are tools that can visualize how libraries manage their costs, staff activity, customer service, user needs, marketing, popular books, circulation, reference transaction, quality of collection, educational programs etc. …”
    Get full text
    Get full text
    Thesis
  11. 11

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

    Classification of Distracted Male Driver Based on Driving Performance Indicator (DPI) by Ganasan, Shatiskumar, Norazlianie, Sazali

    Published 2024
    “…Weka is a strong data mining and machine learning program including algorithms for data preparation, classification, regression, clustering, and visualization. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  13. 13

    Bottleneck-based heuristic for permutation flowshop scheduling by Isa, Noor Amira

    Published 2017
    “…There are four potential dominant machines (M1, M2, M3, M4) clustered as bottleneck machines. A total 1000 set random processing time for each job sizes was tested using Excel simple programming with built in Visual Basic for Application (VBA). …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis