Search Results - (( develop computing clustering algorithm ) OR ( java implementation max algorithm ))

Refine Results
  1. 1

    OPTIMIZED MIN-MIN TASK SCHEDULING ALGORITHM FOR SCIENTIFIC WORKFLOWS IN A CLOUD ENVIRONMENT by Murad S.S., Badeel R., Alsandi N.S.A., Alshaaya R.F., Ahmed R.A., Muhammed A., Derahman M.

    Published 2023
    “…To achieve this, we propose a new noble mechanism called Optimized Min-Min (OMin-Min) algorithm, inspired by the Min-Min algorithm. The objectives of this work are: i) to provide a comprehensive review of the cloud and scheduling process; ii) to classify the scheduling strategies and scientific workflows; iii) to implement our proposed algorithm with various scheduling algorithms (i.e., Min-Min, Round-Robin, Max-Min, and Modified Max-Min) for performance comparison, within different cloudlet sizes (i.e., small, medium, large, and heavy) in three scientific workflows (i.e., Montage, Epigenomics, and SIPHT); and iv) to investigate the performance of the implemented algorithms by using CloudSim. …”
    Review
  2. 2

    Batch mode heuristic approaches for efficient task scheduling in grid computing system by Maipan-Uku, Jamilu Yahaya

    Published 2016
    “…Many algorithms have been implemented to solve the grid scheduling problem. …”
    Get full text
    Get full text
    Get full text
    Thesis
  3. 3
  4. 4
  5. 5

    Data clustering using the bees algorithm by Pham, D.T, Otri, S., Afify, A., Mahmuddin, Massudi, Al-Jabbouli, H.

    Published 2007
    “…One of the most popular clustering methods is k-means clustering because of its simplicity and computational efficiency. …”
    Get full text
    Get full text
    Conference or Workshop Item
  6. 6
  7. 7

    Towards lowering computational power in IoT systems: Clustering algorithm for high-dimensional data stream using entropy window reduction by Alkawsi G., Al-amri R., Baashar Y., Ghorashi S., Alabdulkreem E., Kiong Tiong S.

    Published 2024
    “…Lately, a fully online buffer-based clustering algorithm for handling evolving data streams (BOCEDS) was developed. …”
    Article
  8. 8

    Efficient genetic partitioning-around-medoid algorithm for clustering by Garib, Sarmad Makki Mohammed

    Published 2019
    “…These algorithms mostly built upon the partitioning k-means clustering algorithm. …”
    Get full text
    Get full text
    Thesis
  9. 9
  10. 10
  11. 11
  12. 12
  13. 13

    An adaptive density-based method for clustering evolving data streams / Amineh Amini by Amini, Amineh

    Published 2014
    “…Due to these characteristics the traditional densitybased clustering is not applicable. Recently, a number of density-based algorithms have been developed for clustering data streams. …”
    Get full text
    Get full text
    Get full text
    Thesis
  14. 14
  15. 15
  16. 16
  17. 17

    Optimized clustering with modified K-means algorithm by Alibuhtto, Mohamed Cassim

    Published 2021
    “…The proposed algorithm utilised a distance measure to compute the between groups’ separation to accelerate the process of identifying an optimal number of clusters using k-means. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  18. 18

    The Parallel Fuzzy C-Median Clustering Algorithm Using Spark for the Big Data by Mallik, Moksud Alam, Zulkurnain, Nurul Fariza, Siddiqui, Sumrana, Sarkar, Rashel

    Published 2024
    “…Therefore, we develop a Parallel Fuzzy C-Median Clustering Algorithm Using Spark for Big Data that can handle large datasets while maintaining high accuracy and scalability. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  19. 19

    Topological Clustering via Adaptive Resonance Theory With Information Theoretic Learning by Masuyama, Naoki, Loo, Chu Kiong, Ishibuchi, Hisao, Kubota, Naoyuki, Nojima, Yusuke, Liu, Yiping

    Published 2019
    “…Other types of the ART-based topological clustering algorithms have been developed, however, these algorithms have various drawbacks such as a large number of parameters, sensitivity to noisy data. …”
    Get full text
    Get full text
    Article
  20. 20