Search Results - (( developing consumer path algorithm ) OR ( java visualization using algorithm ))

Search alternatives:

Refine Results
  1. 1
    A performance analysis of association rule mining algorithms

    A performance analysis of association rule mining algorithms by Fageeri, S.O., Ahmad, R., Alhussian, H.

    Published 2016
    “…In this paper, we evaluate the performance of association rule mining algorithms in-terms of execution times and memory usage using the CPU profiler of Java VisualVM. …”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  2. 2
    Automated path testing using the negative selection algorithm

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

    Published 2017
    “…Software testing is an important step in the software development process, accounting for more than 50% of software development cost as it is laborious and time-consuming. …”
    Get full text
    Get full text
    Indexed Article
    Save to List
    Saved in:
  3. 3
    Performance evaluation of real-time multiprocessor scheduling algorithms

    Performance evaluation of real-time multiprocessor scheduling algorithms by Alhussian, H., Zakaria, N., Abdulkadir, S.J., Fageeri, S.O.

    Published 2016
    “…We hyave used the CPU profiler of Oracle JavaTM VisualVM to monitor the execution of LRE-TL as well as USG algorithms. …”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  4. 4
    Shortest Path Trajectory System Based on Dijkstra Algorithm

    Shortest Path Trajectory System Based on Dijkstra Algorithm by Putri, Indah Pratiwi

    Published 2012
    “…This project includes the modification of main algorithm which has been implemented in the prototype development. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  5. 5
    Simulation of identifying shortest path walkway in library by using ant colony optimization

    Simulation of identifying shortest path walkway in library by using ant colony optimization by Chui Teng, Chan

    Published 2012
    “…Therefore,by determining the shortest path will help in reducing the time consume problem.This project is developed by starting with designing the workflow diagram as well as the design of the output interface.The work flow is the guide for the process of development.In between,Heuristic Approach is used to determine the entire possible paths at first,then Ant Colony Optimization algorithm will be implemented to search for the final and the shortest path. …”
    Get full text
    Get full text
    Undergraduates Project Papers
    Save to List
    Saved in:
  6. 6
    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:
  7. 7
    Dijkstra’s algorithm in Product Searching System (ProSearch) / Nur Hasni Nasrudin ... [et al.]

    Dijkstra’s algorithm in Product Searching System (ProSearch) / Nur Hasni Nasrudin ... [et al.] by Nasrudin, Nur Hasni, Nasaruddin, Siti Hajar, Syed Abdul Halim, Syarifah Syafiqah Wafa, Ahmad Junid, Rosida

    Published 2015
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  8. 8
    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:
  9. 9
    Recent research in cooperative path planning algorithms for multi-agent using mixed- integer linear programming

    Recent research in cooperative path planning algorithms for multi-agent using mixed- integer linear programming by Che Ku, Nor Azie Hailma, Omar, Rosli, Sabudin Elia Nadira, Sabudin Elia Nadira

    Published 2016
    “…Path planning is one of the issues to be handled in the development of autonomous systems. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  10. 10
    Test case generation from state machine with OCL constraints using search-based techniques / Aneesa Ali Ali Saeed

    Test case generation from state machine with OCL constraints using search-based techniques / Aneesa Ali Ali Saeed by Aneesa Ali, Ali Saeed

    Published 2017
    “…Software testing consumes half of the entire software development cost where test case generation is the most cost consuming activity in the whole process. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  11. 11
    Visdom: Smart guide robot for visually impaired people

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

    Published 2025
    “…An Android mobile application, developed using Java and the java.net.Socket library, provides an intuitive and accessible user interface for seamless interaction with the robot. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
    Save to List
    Saved in:
  12. 12
    Simulation of identifying shortest path walkway using particle swarm optimization (PSO)

    Simulation of identifying shortest path walkway using particle swarm optimization (PSO) by Kae Shin, Yong

    Published 2012
    “…Therefore, this project is develop to find the shortest path which means to find a path with minimum distance between two locations by apply the algorithm of Particle Swarm Optimization technique.This system is expected to solve the shortest path and identify the optimal path.Due to this,it is tend to reduce the time consume in specific situation with the determining of shortest path. …”
    Get full text
    Get full text
    Undergraduates Project Papers
    Save to List
    Saved in:
  13. 13
    Test case minimization applying firefly algorithm

    Test case minimization applying firefly algorithm by Hashim, Nor Laily, Dawood, Yasir Salman

    Published 2018
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  14. 14
    Web-based RIG performance reporting system using interactive visualization techniques / Amir Hambaly Nasaruddin

    Web-based RIG performance reporting system using interactive visualization techniques / Amir Hambaly Nasaruddin by Nasaruddin, Amir Hambaly

    Published 2019
    “…D3.js is used as a technology to visualize the result in interactive form or dynamic visualization which is a JavaScript library and Python is a language to program the system. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  15. 15
    Development of low power viterbi decoder on complex programmable logic device platform

    Development of low power viterbi decoder on complex programmable logic device platform by Abu, Mohd Azlan

    Published 2018
    “…For the path metric updater unit (PMU), the traditional method of Viterbi algorithm is to store the selected minimum value of branch metric in the memory unit. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  16. 16
    Enhanced bibliographic data retrieval and visualization using query optimization and spectral centrality measure

    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
    Save to List
    Saved in:
  17. 17
    Design Of Robot Motion Planning Algorithm For Wall Following Robot

    Design Of Robot Motion Planning Algorithm For Wall Following Robot by Ali Hassan, Muhamad Khairul

    Published 2006
    “…Algorithms are developed for a simulated mobile robot that uses an array of range finders for navigation. …”
    Get full text
    Get full text
    Monograph
    Save to List
    Saved in:
  18. 18
    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:
  19. 19
    Dynamic force-directed graph with weighted nodes for scholar network visualization

    Dynamic force-directed graph with weighted nodes for scholar network visualization by Mohd. Aris, Khalid Al-Walid, Ramasamy, Chitra, Mohd Aris, Teh Noranis, Zolkepli, Maslina

    Published 2022
    “…The approach is realized by creating a web-based interface using D3 JavaScript algorithm that allows the visualization to focus on how data are connected to each other more accurately than the conventional lines of data seen in traditional data representation. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  20. 20
    An experimental study of neighbourhood based metaheuristic algorithms for test case generation satisfying the modified condition / decision coverage criterion

    An experimental study of neighbourhood based metaheuristic algorithms for test case generation satisfying the modified condition / decision coverage criterion by Haque, Ariful

    Published 2018
    “…Therefore, it is mandatory to test all possible functional paths of the software exhaustively. Exhaustive testing is costly and time consuming and with the higher number of inputs, the number of test cases increases exponentially. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:

Search Tools: