Search Results - (( java simulation optimization algorithm ) OR ( using selected new 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
    “…The proposed algorithm is known as the enhance ant colony optimization (EACO). …”
    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
    “…A simulation environment was developed using Java programming to test the performance of the proposed EACO algorithm against existing grid resource management algorithms such as Antz algorithm, Particle Swarm Optimization algorithm, Space Shared algorithm and Time Shared algorithm, in terms of processing time and resource utilization. …”
    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
  5. 5

    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. …”
    Review
  6. 6

    Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization by Mohammad Ata, Karimeh Ibrahim

    Published 2019
    “…This study proposes a car parking management system which applies Dijkstra’s algorithm, Ant Colony Optimization (ACO) and Binary Search Tree (BST) in structuring a guidance system for indoor parking. …”
    Get full text
    Get full text
    Thesis
  7. 7

    Features selection for intrusion detection system using hybridize PSO-SVM by Tabaan, Alaa Abdulrahman

    Published 2016
    “…Hybridize Particle Swarm Optimization (PSO) as a searching algorithm and support vector machine (SVM) as a classifier had been implemented to cope with this problem. …”
    Get full text
    Get full text
    Thesis
  8. 8

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

    A New And Fast Rival Genetic Algorithm For Feature Selection by Too, Jing Wei, Abdullah, Abdul Rahim

    Published 2021
    “…The genetic algorithm (GA) as a fundamental optimization tool has been widely used in feature selection tasks. …”
    Get full text
    Get full text
    Get full text
    Article
  10. 10

    Formulating new enhanced pattern classification algorithms based on ACO-SVM by Alwan, Hiba Basim, Ku-Mahamud, Ku Ruhana

    Published 2013
    “…ACO originally deals with discrete optimization problem.In applying ACO for solving SVM model selection problem which are continuous variables, there is a need to discretize the continuously value into discrete values.This discretization process would result in loss of some information and hence affects the classification accuracy and seeking time.In this algorithm we propose to solve SVM model selection problem using IACOR without the need to discretize continuous value for SVM.The second algorithm aims to simultaneously solve SVM model selection problem and selects a small number of features.SVM model selection and selection of suitable and small number of feature subsets must occur simultaneously because error produced from the feature subset selection phase will affect the values of SVM model selection and result in low classification accuracy.In this second algorithm we propose the use of IACOMV to simultaneously solve SVM model selection problem and features subset selection.Ten benchmark datasets were used to evaluate the proposed algorithms.Results showed that the proposed algorithms can enhance the classification accuracy with small size of features subset.…”
    Get full text
    Get full text
    Get full text
    Article
  11. 11

    Improved combined mutation clonal selection algorithm by Paw J.K.S., Hen C.K., Yan K.W., Ann Y.S.

    Published 2023
    “…The new and improved algorithm was tested using various unimodal and multimodal test functions to illustrate the improvements of the algorithm. …”
    Conference paper
  12. 12

    Implementation of a new Preference Based Final Year Project title selection system for undergraduate engineering students in UNITEN by Hasan M.H., Mohamed Sahari K.S., Anuar A.

    Published 2023
    “…The Network Flow Optimization algorithm, which was able to produce a selection with the lowest cost, was selected and used to allocate titles for students from Semester 1 of the 2009/2010 academic year. …”
    Article
  13. 13

    New selection algorithm for Mengubah Destini Anak Bangsa (MDAB) students / Zamali Tarmudi ... [et al.] by Tarmudi, Zamali, Saibin, Tammie Christy, Naharu, Nasrah, Ung, Ling Ling

    Published 2014
    “…This research introduces a new algorithm to select students from low income family the so-called Mengubah Destini Anak Bangsa (MDAB) using fuzzy approach. …”
    Get full text
    Get full text
    Research Reports
  14. 14

    A new stepsize for gradient method via weak secant equation by Leong, Wah June

    Published 2007
    “…The algorithm then selects the stepsizes along the negative gradient using a new approximation of the Hessian based on the weak secant equation. …”
    Get full text
    Conference or Workshop Item
  15. 15

    Adaptive differential evolution algorithm with fitness based selection of parameters and mutation strategies / Rawaa Dawoud Hassan Al-Dabbagh by Rawaa Dawoud Hassan, Al-Dabbagh

    Published 2015
    “…The second taxonomy is a new taxonomy proposed to classify the adaptive DE algorithms in particular into two categories (DE with adaptive parameters and DE with adaptive parameters and strategies) considering the adaptive components used in this algorithm. …”
    Get full text
    Get full text
    Thesis
  16. 16

    Feature Selection And Enhanced Krill Herd Algorithm For Text Document Clustering by Abualigah, Laith Mohammad Qasim

    Published 2018
    “…In this study, a new method for solving the TD clustering problem worked in the following two stages: (i) A new feature selection method using particle swarm optimization algorithm with a novel weighting scheme and a detailed dimension reduction technique are proposed to obtain a new subset of more informative features with low-dimensional space.…”
    Get full text
    Get full text
    Thesis
  17. 17
  18. 18
  19. 19

    Dynamic Bayesian Networks and Variable Length Genetic Algorithm for Dialogue Act Recognition by Ali Yahya, Anwar

    Published 2007
    “…In the selection phase, a new variable length genetic algorithm is applied to select the lexical cues. …”
    Get full text
    Get full text
    Thesis
  20. 20

    Comparison between Genetic Algorithm and Prey-Predator Algorithm. by Ong, Hong Choon

    “…We also compared the performance of this algorithm with the genetic algorithm on selected test problems and we showed that the new algorithm performed better in our publication.…”
    Get full text
    Monograph