Search Results - (( integer implementation 5s algorithm ) OR ( java implementation max algorithm ))

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

    Modification of particle swarm optimization algorithm for optimization of discrete values by Mohd Yassin, Ahmad Ihsan, Jusoh, Muhammad Huzaimy, Abdul Rahman, Farah Yasmin

    Published 2011
    “…These methods generally either represent the solution in binary form [5) or round off the continuous results into the closest integer [6-8). …”
    Get full text
    Get full text
    Research Reports
  6. 6
  7. 7

    Fpga Implementation Of Metaheuristic Optimization Algorithm by Phuah, Soon Eu

    Published 2022
    “…Then the Discrete SKF was adapted from the original metaheuristic by rounding all floating-point values to integers as well as setting a fixed Kalman gain of 0.5. …”
    Get full text
    Get full text
    Undergraduates Project Papers
  8. 8
  9. 9

    FPGA implementation of metaheuristic optimization algorithm by Nurul Hazlina, Noordin, Phuah, Soon Eu, Zuwairie, Ibrahim

    Published 2023
    “…Then the Discrete SKF was adapted from the original metaheuristic by rounding all floating-point values to integers as well as setting a fixed Kalman gain of 0.5. …”
    Get full text
    Get full text
    Get full text
    Article
  10. 10

    Case Slicing Technique for Feature Selection by A. Shiba, Omar A.

    Published 2004
    “…The classification accuracy obtained from the CST method is compared to other selected classification methods such as Value Difference Metric (VDM), Pre-Category Feature Importance (PCF), Cross-Category Feature Importance (CCF), Instance-Based Algorithm (IB4), Decision Tree Algorithms such as Induction of Decision Tree Algorithm (ID3) and Base Learning Algorithm (C4.5), Rough Set methods such as Standard Integer Programming (SIP) and Decision Related Integer Programming (DRIP) and Neural Network methods such as the Multilayer method.…”
    Get full text
    Get full text
    Thesis
  11. 11

    Investigation on pattern based Algorithm for division by a constant number using Verilog code for optimization on the Nelust results by Fouziah Md Yassin, Ag Asri Ag Ibrahim, Zaturrawiah Ali Omar, Saturi Baco

    Published 2015
    “…The result is rounded to the nearest integer for divisors of 3, 5, 6, 7 and 9. The methodology of this research are involving design specification, high level design using C++, RTL level description using Verilog, functional verification and logic synthesis using two different technology library. …”
    Get full text
    Get full text
    Research Report
  12. 12
  13. 13
  14. 14
  15. 15
  16. 16
  17. 17

    Classification of breast cancer disease using bagging fuzzy-id3 algorithm based on fuzzydbd by Nur Farahaina, Idris

    Published 2022
    “…There are various decision tree algorithms, but the most commonly used are Iterative Dichotomiser 3 (ID3), CART, and C4.5. …”
    Get full text
    Get full text
    Thesis
  18. 18

    Rounded off unsigned constant division using add-shift in verilog by Fouziah Md Yassin, Ag Asri Ag Ibrahim, Zaturrawiah Ali Omar, Saturi Baco, Nor Azura Zakaria, Edward V.Bautista Jr.

    Published 2016
    “…This paper presents the logic synthesis result of the add-shift scheme that was modified from existing algorithm and was described in Verilog code. The constant denominators (deno) were 3, 5, 6, 7 and 9 and the input variables (n) were of 13 bits. …”
    Get full text
    Get full text
    Article
  19. 19
  20. 20

    Identification of debris flow initiation zones using topographic model and airborne laser scanning data by Lay, Usman Salihu, Pradhan, Biswajeet

    Published 2017
    “…Three models were executed at different spatial resolution scales: 5, 10 and 15 m, respectively. MARSpline multivariate data mining predictive approach was implemented using morphometric indices and topographical derived parameter as independent variables. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item