Search Results - (( basic visualization clustering algorithm ) OR ( java implementation max algorithm ))

  • Showing 1 - 5 results of 5
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

    Defect Detection And Classification Of Silicon Solar Wafer Featuring Nir Imaging And Improved Niblack Segmentation by Mahdavipour, Zeinab

    Published 2016
    “…The classification combines the analysis of defect intensity features, the application of unsupervised k-mean clustering and multi-class SVM algorithms. The methods have been applied for detecting, clustering and classification polycrystalline solar wafer images, corresponding to defects such as micro cracks, stain, and fingerprints. …”
    Get full text
    Get full text
    Thesis
  5. 5

    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