Search Results - (( developing general selection algorithm ) OR ( java loading optimization algorithm ))

Refine Results
  1. 1

    Ant colony optimization algorithm for load balancing in grid computing by Ku-Mahamud, Ku Ruhana, Mohamed Din, Aniza

    Published 2012
    “…This research proposes an enhancement of the ant colony optimization algorithm that caters for dynamic scheduling and load balancing in the grid computing system. …”
    Get full text
    Get full text
    Get full text
    Monograph
  2. 2

    Enhancement of Ant Colony Optimization for Grid Job Scheduling and Load Balancing by Husna, Jamal Abdul Nasir

    Published 2011
    “…This research proposes an Enhanced Ant Colony Optimization (EACO) algorithm that caters dynamic scheduling and load balancing in the grid computing system. …”
    Get full text
    Get full text
    Get full text
    Thesis
  3. 3

    Resource management in grid computing using ant colony optimization by Ku-Mahamud, Ku Ruhana, Mohamed Din, Aniza

    Published 2011
    “…Resources with high pheromone value are selected to process the submitted jobs.Global pheromone update is performed after completion processing the jobs in order to reduce the pheromone value of resources.A simulation environment was developed using Java programming to test the performance of the proposed EACO algorithm against other ant based algorithm, in terms of resource utilization.Experimental results show that EACO produced better grid resource management solution.…”
    Get full text
    Get full text
    Get full text
    Get full text
    Monograph
  4. 4

    Implementation of locust inspired scheduling algorithm with huge number of servers for energy efficiency in a cloud datacenter by Azhar, Nur Huwaina

    Published 2019
    “…Cloudsim is used as Discrete Event Simulation tool and Java as coding language to evaluate LACE algorithm. …”
    Get full text
    Get full text
    Thesis
  5. 5
  6. 6
  7. 7
  8. 8
  9. 9

    Extended multiple models selection algorithms based on iterative feasible generalized least squares (IFGLS) and expectation-maximization (EM) algorithm by Nur Azulia, Kamarudin

    Published 2019
    “…This extension of Autometrics for model selection was also developed for multiple equations by integrating it with seemingly unrelated regressions equations (SURE) and estimated using feasible generalized least squares (FGLS), known as SURE-Autometrics algorithm. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  10. 10

    Enhancement of bearing defect diagnosis via genetic algorithm optimized feature selection by Chia, Yee Shin

    Published 2015
    “…However this feature selection algorithm might be unstable due to the stochastic property of GA. …”
    Get full text
    Get full text
    Get full text
    Thesis
  11. 11

    SURE-Autometrics algorithm for model selection in multiple equations by Norhayati, Yusof

    Published 2016
    “…Thus, this study aims to develop an algorithm for model selection in multiple equations focusing on seemingly unrelated regression equations (SURE) model. …”
    Get full text
    Get full text
    Get full text
    Thesis
  12. 12
  13. 13
  14. 14
  15. 15

    Development of genetic algorithm-based fuzzy rules design for metal cutting data selection by Wong, S.V, Hamouda, A.M.S

    Published 2002
    “…The authors have developed fuzzy models for machinability data selection (Int. …”
    Get full text
    Get full text
    Get full text
    Article
  16. 16
  17. 17
  18. 18

    Selection and optimization of peak features for event-related eeg signals classification / Asrul bin Adam by Asrul, Adam

    Published 2017
    “…However, the developed algorithms only consider the selected features from a peak model based on the understanding of the EEG signals characteristics. …”
    Get full text
    Get full text
    Get full text
    Thesis
  19. 19

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

    Published 2019
    “…However, the complexity of the kmedoid based algorithms in general is more than the complexity of the k-means based algorithms. …”
    Get full text
    Get full text
    Thesis
  20. 20