Search Results - (( using interactive process algorithm ) OR ( java application clustering algorithm ))

Search alternatives:

Refine Results
  1. 1
    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
    “…Each web services are easily maintainable since there is loose coupling between interacting nodes. 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:
  2. 2
    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:
  3. 3
    A Toolkit for Simulation of Desktop Grid Environment

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

    Published 2014
    “…The prototypes will be developed using JAVA language united with a MySQL database. Core functionality of the simulator are job generation, volunteer generation, simulating algorithms, generating graphical charts and generating reports. …”
    Get full text
    Get full text
    Final Year Project
    Save to List
    Saved in:
  4. 4
    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:
  5. 5
    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:
  6. 6
    Constrained clustering approach to aid in remodularisation of object-oriented software systems / Chong Chun Yong

    Constrained clustering approach to aid in remodularisation of object-oriented software systems / Chong Chun Yong by Chong, Chun Yong

    Published 2016
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  7. 7
    A comparative study on testing optimization techniques with combinatorial interaction testing for optimizing software product line testing

    A comparative study on testing optimization techniques with combinatorial interaction testing for optimizing software product line testing by Maidin, Nur Farrahin, Hassan, Sa’Adah, Baharom, Salmi, Md. Sultan, Abu Bakar

    Published 2025
    “…By using the best optimization algorithm with the optimum number of interaction strengths, the complexity of the SPL testing process could be reduced without prejudicing the quality of the software system itself.…”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  8. 8
    Effects of Different Superpixel Algorithms on Interactive Segmentations

    Effects of Different Superpixel Algorithms on Interactive Segmentations by Soo See, Chai, Luong Goh, Kok, Weng Ng, Giap, Muzaffar, Hamzah

    Published 2022
    “…Though employed as pre-processing step in many interactive segmentation algorithms, to date, no study has been conducted to assess the effects of such incorporations on the segmentation algorithms. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  9. 9
    Effects of Different Superpixel Algorithms on Interactive Segmentations

    Effects of Different Superpixel Algorithms on Interactive Segmentations by Goh, Kok Luong, Ng, Giap Weng, Muzaffar Hamzah, Chai, Soo See

    Published 2022
    “…Though employed as pre-processing step in many interactive segmentation algorithms, to date, no study has been conducted to assess the effects of such incorporations on the segmentation algorithms. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  10. 10
    Sizes of Superpixels and their Effect on Interactive Segmentation

    Sizes of Superpixels and their Effect on Interactive Segmentation by Kok, Luong Goh, Giap, Weng Ng, Muzaffar Hamzah, Soo, See Chai

    Published 2021
    “…Despite the fact that it is used as a pre-processing step in many interactive segmentation algorithms, less studies had been conducted to assess the effects of the size of superpixels required by interactive segmentation algorithms to achieve an optimal result. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Proceedings
    Save to List
    Saved in:
  11. 11
    Sizes of Superpixels and their Effect on Interactive Segmentation

    Sizes of Superpixels and their Effect on Interactive Segmentation by Goh, Kok Luong, Ng, Giap Weng, Muzaffar, Hamzah, Chai, Soo See

    Published 2021
    “…Despite the fact that it is used as a pre-processing step in many interactive segmentation algorithms, less studies had been conducted to assess the effects of the size of superpixels required by interactive segmentation algorithms to achieve an optimal result. …”
    Get full text
    Get full text
    Get full text
    Proceeding
    Save to List
    Saved in:
  12. 12
    Efficient prime-based method for interactive mining of frequent patterns.

    Efficient prime-based method for interactive mining of frequent patterns. by Mohammad Hossein, Nadimi Shahraki, Mustapha, Norwati, Sulaiman, Md. Nasir, Mamat, Ali

    Published 2011
    “…During the mining process, the mining algorithm reduces the number of candidate patterns and comparisons by using a new candidate set called candidate head set and several efficient pruning techniques. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  13. 13
    VISUALIZATION OF GENETIC ALGORITHM BASED ON 2-D GRAPH TO ACCELERATE THE SEARCHING WITH HUMAN INTERVENTIONS.

    VISUALIZATION OF GENETIC ALGORITHM BASED ON 2-D GRAPH TO ACCELERATE THE SEARCHING WITH HUMAN INTERVENTIONS. by FAROOQ, HUMERA

    Published 2012
    “…Visualization techniques help in understanding the searching behaviour of Genetic Algorithm. lt also makes possible the user interactions during the searching process. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  14. 14
    On Adopting Parameter Free Optimization Algorithms for Combinatorial Interaction Testing

    On Adopting Parameter Free Optimization Algorithms for Combinatorial Interaction Testing by Kamal Z., Zamli, Alsariera, Yazan A., Nasser, Abdullah B., Alsewari, Abdulrahman A.

    Published 2015
    “…Although useful, strategies based on the aforementioned optimization algorithms are not without limitation. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  15. 15
    SYSTEM IDENTIFICATION AND MODEL PREDICTIVE CONTROL FOR INTERACTING SERIES PROCESS WITH NONLINEAR DYNAMICS

    SYSTEM IDENTIFICATION AND MODEL PREDICTIVE CONTROL FOR INTERACTING SERIES PROCESS WITH NONLINEAR DYNAMICS by SETYO WIBOWO, TRI CHANDRA

    Published 2009
    “…The study is carried out by experimental works using the gaseous pilot plant as the process. The gaseous pilot plant exhibits the typical dynamic of an interacting series process, where the strong interaction between upstream and downstream properties occurs in both ways. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  16. 16
    An integration of AHP-ACO technique for social interaction and travel planning

    An integration of AHP-ACO technique for social interaction and travel planning by Peh, Perly Thai Ee

    Published 2016
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  17. 17
    Superpixel Sizes using Topology Preserved Regular Superpixel Algorithm and their Impacts on Interactive Segmentation

    Superpixel Sizes using Topology Preserved Regular Superpixel Algorithm and their Impacts on Interactive Segmentation by Goh, Kok Luong, Chai, Soo See, Ng, Giap Weng, Muzaffar Hamzah

    Published 2022
    “…It is possible to speed up and improve the end result of segmentation by using pre-processing steps. The use of superpixels is an example of a pre-processing step. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  18. 18
    Enhancing Harmony Search Metaheuristic Algorithm for Coverage Efficiency, Test Suite Reduction, and Running Time in Combinatorial Interaction Testing

    Enhancing Harmony Search Metaheuristic Algorithm for Coverage Efficiency, Test Suite Reduction, and Running Time in Combinatorial Interaction Testing by Muazu, Aminu Aminu, Hashim, Ahmad Sobri

    Published 2025
    “…By systematically covering combinations of input values, CIT can uncover faults that arise from complex interactions. One key aspect of CIT is coverage efficiency, which ensures that the desired interaction coverage is achieved with the fewest possible test cases, optimizing the testing process. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  19. 19
    Superpixel Sizes using Topology Preserved Regular Superpixel Algorithm and their Impacts on Interactive Segmentation

    Superpixel Sizes using Topology Preserved Regular Superpixel Algorithm and their Impacts on Interactive Segmentation by Kok Luong, Goh, Soo See, Chai, Giap Weng, Ng, Muzaffar, Hamzah

    Published 2022
    “…It is possible to speed up and improve the end result of segmentation by using pre-processing steps. The use of superpixels is an example of a pre-processing step. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  20. 20
    Segmentation of MRI brain images using statistical approaches

    Segmentation of MRI brain images using statistical approaches by Balafar, Mohammad Ali

    Published 2011
    “…Moreover, three improvements of EM for brain MRI segmentation are proposed, which incorporate neighbourhood information in a new manner in the clustering process. In addition, two algorithms for the post-processing of clustering results using user-interaction and the re-evaluation of boundary data in each cluster are presented. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:

Search Tools: