Search Results - (( integer implementation search algorithm ) OR ( java implementation max algorithm ))

  • Showing 1 - 10 results of 10
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
  3. 3

    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
  4. 4

    Problem restructuring in interger programming for reduct searching by Ungku Chulan, Ungku Azmi Iskandar

    Published 2003
    “…Standard Integer Programming / Decision Related Integer Programming (SIP/DRIP) is a reduct searching system that finds the reducts in an information system. …”
    Get full text
    Get full text
    Thesis
  5. 5

    Sequential and parallel multiple tabu search algorithm for multiobjective urban transit scheduling problems by Uvaraja, Vikneswary

    Published 2018
    “…Additionally, the MTS algorithm is also implemented in parallel computing to produce parallel MTS for generating comparable solutions in shorter computational times. …”
    Get full text
    Get full text
    Thesis
  6. 6

    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
    “…Stochastic-type algorithms have shown good performance in locating the global optima in optimization problems, even in difficult search spaces [1). …”
    Get full text
    Get full text
    Research Reports
  7. 7

    Propositional satisfiability method in rough classification modeling for data mining by Abu Bakar, Azuraliza

    Published 2002
    “…Four of the datasets were then chosen for further experiment. The improved search strategy implemented the non-chronological backtracking search that potentially prunes the large portion of search space. …”
    Get full text
    Get full text
    Thesis
  8. 8

    Optimization of Upstream Offshore Oilfield Production Planning under Uncertainty and Downstream Crude Oil Scheduling at Refinery Front-End by Tan Yin Keong, Tan Yin

    Published 2012
    “…A continuous time model based on transfer events is used to represent the scheduling problem and this model is a nonconvex MINLP model which presents multiple local optima. We implement a branch-and-contract algorithm that aims at reducing the size of the search region. …”
    Get full text
    Get full text
    Final Year Project
  9. 9

    Optimization of Upstream Offshore Oilfield Production Planning under Uncertainty and Downstream Crude Oil Scheduling at Refinery Front-End by Tan , Yin Keong

    Published 2009
    “…Acontinuous time model based on transfer events is used to represent the scheduling problem and this model is a nonconvex MINLP model which presents multiple local optima. We implement a branch-and-contract algorithm that aims at reducing the size of the search region. …”
    Get full text
    Get full text
    Final Year Project
  10. 10