Search Results - (( variable generation means algorithm ) OR ( java simulation optimization algorithm ))

Refine Results
  1. 1
  2. 2

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

    Published 2011
    “…Global pheromone update is performed after the completion of 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 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

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

    Optimized clustering with modified K-means algorithm by Alibuhtto, Mohamed Cassim

    Published 2021
    “…In order to obtain the optimum number of clusters and at the same time could deal with correlated variables in huge data, modified k-means algorithm was proposed. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  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

    Fast and Accuracy Control Chart Pattern Recognition using a New cluster-k-Nearest Neighbor by Brahim Belhaouari, samir

    Published 2009
    “…By taking advantage of both k-NN which is highly accurate and K-means cluster which is able to reduce the time of classi¯cation, we can introduce Cluster-k-Nearest Neighbor as "variable k"-NN dealing with the centroid or mean point of all subclasses generated by clustering algorithm. …”
    Get full text
    Get full text
    Citation Index Journal
  7. 7

    Fast and Accuracy Control Chart Pattern Recognition using a New cluster-k-Nearest Neighbor by Brahim Belhaouari, samir

    Published 2008
    “…By taking advantage of both k-NN which is highly accurate and K-means cluster which is able to reduce the time of classi¯cation, we can introduce Cluster-k-Nearest Neighbor as "variable k"-NN dealing with the centroid or mean point of all subclasses generated by clustering algorithm. …”
    Get full text
    Get full text
    Citation Index Journal
  8. 8

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

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

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

    Gas Identi cation by Using a Cluster-k-Nearest-Neighbor by Brahim Belhaouari, samir

    Published 2009
    “…Our classify takes advantage of both k-NN which is highly accurate and K-means cluster which is able to reduce the time of classification, we introduce Cluster-k-Nearest Neighbor as “variable k”-NN dealing with the centroid or mean point of all subclasses generated by clustering algo-rithm. …”
    Get full text
    Get full text
    Article
  12. 12

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

    Fuzzy Type-1 Triangular Membership Function Approximation Using Fuzzy C-Means by Azam, M.H., Hasan, M.H., Hassan, S., Abdulkadir, S.J.

    Published 2020
    “…Initially, the Fuzzy C-means algorithm is utilized to generate the parameters values of the Gaussian membership function. …”
    Get full text
    Get full text
    Conference or Workshop Item
  14. 14

    Fuzzy Adaptive Tuning of a Particle Swarm Optimization Algorithm for Variable-Strength Combinatorial Test Suite Generation by Kamal Z., Zamli, Ahmed, Bestoun S., Mahmoud, Thair, Afzal, Wasif

    Published 2018
    “…The generation of variable strength test suites is a non-deterministic polynomial-time (NP) hard computational problem \cite{BestounKamalFuzzy2017}. …”
    Get full text
    Get full text
    Get full text
    Book Chapter
  15. 15

    Dynamic Bayesian networks and variable length genetic algorithm for designing cue-based model for dialogue act recognition by Yahya, Anwar Ali, Mahmod, Ramlan, Ramli, Abd Rahman

    Published 2010
    “…The model is, essentially, a dynamic Bayesian network induced from manually annotated dialogue corpus via dynamic Bayesian machine learning algorithms. Furthermore, the dynamic Bayesian network's random variables are constituted from sets of lexical cues selected automatically by means of a variable length genetic algorithm, developed specifically for this purpose. …”
    Get full text
    Get full text
    Article
  16. 16
  17. 17

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

    Published 2019
    “…These algorithms mostly built upon the partitioning k-means clustering algorithm. …”
    Get full text
    Get full text
    Thesis
  18. 18

    Seed disperser ant algorithm for optimization / Chang Wen Liang by Chang , Wen Liang

    Published 2018
    “…The genotype of every ant is represented in binary form as the variables. These binary variables are used to locally search for optimum solution. …”
    Get full text
    Get full text
    Get full text
    Thesis
  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

    Evaluating different machine learning models for predicting municipal solid waste generation: a case study of Malaysia by Latif S.D., Hazrin N.A.B., Younes M.K., Ahmed A.N., Elshafie A.

    Published 2025
    “…The previous machine algorithm applied in the proposed study area Malaysia was an artificial neural network using NARX inputs to accommodate the need of forecasting municipal solid waste generations in Malaysia. …”
    Article