Search Results - (( terms selection based algorithm ) OR ( java simulation 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
    “…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 other ant based algorithm, in terms of resource utilization. …”
    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

    Enhancing the QoS performance for mobile station over LTE and WiMAX networks / Mhd Nour Hindia by Hindia, Mhd Nour

    Published 2015
    “…The selection is based on the user preferences since it uses a self-learning algorithm to determine triggers and handover thresholds dynamically. …”
    Get full text
    Get full text
    Thesis
  9. 9

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

    Ant colony optimization for rule induction with simulated annealing for terms selection by Saian, Rizauddin, Ku-Mahamud, Ku Ruhana

    Published 2012
    “…This paper proposes a sequential covering based algorithm that uses an ant colony optimization algorithm to directly extract classification rules from the data set.The proposed algorithm uses a Simulated Annealing algorithm to optimize terms selection, while growing a rule.The proposed algorithm minimizes the problem of a low quality discovered rule by an ant in a colony, where the rule discovered by an ant is not the best quality rule, by optimizing the terms selection in rule construction. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  11. 11

    Feature selection to enhance android malware detection using modified term frequency-inverse document frequency (MTF-IDF) by Mazlan, Nurul Hidayah

    Published 2019
    “…This research synthesizes an evaluation of feature selection algorithm by utilizing Term Frequency-Inverse Document Frequency (TF-IDF) as the main algorithm in Android malware detection. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  12. 12

    Aco-based feature selection algorithm for classification by Al-mazini, Hassan Fouad Abbas

    Published 2022
    “…The experimental results of the EGCACO algorithm on the UCI dataset are superior to other benchmark optimisation algorithms in terms of the number of selected features for 16 out of the 18 UCI datasets (88.89%) and the best in eight (8) (44.47%) of the datasets for classification accuracy. …”
    Get full text
    Get full text
    Thesis
  13. 13

    Mutable composite firefly algorithm for gene selection in microarray based cancer classification by Fajila, Mohamed Nisper Fathima

    Published 2022
    “…Hence, this study proposed to modify the Firefly Algorithm (FA) along with the Correlation-based Feature Selection (CFS) filter for the gene selection task. …”
    Get full text
    Get full text
    Thesis
  14. 14

    Deterministic Mutation-Based Algorithm for Model Structure Selection in Discrete-Time System Identification by Abd Samad, Md Fahmi

    Published 2011
    “…A deterministic mutation-based algorithm is introduced to overcome this problem. …”
    Get full text
    Get full text
    Get full text
    Article
  15. 15

    An Evolutionary Algorithm: An Enhancement of Binary Tournament Selection for Fish Feed Formulation by Soong, Cai Juan, Abd Rahman, Rosshairy, Ramli, Razamin, Abd Manaf, Mohammed Suhaimee, Chek-Choon, Ting

    Published 2022
    “…*e novelty of the proposed SD tournament selection is compared with BT selection in terms of searching for an efficient but not myopic algorithm. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  16. 16

    Opposition-Based Learning Binary Bat Algorithm as Feature Selection Approach in Taguchi's T-Method by Marlan Z.M., Jamaludin K.R., Harudin N.

    Published 2024
    “…Thus, this study proposed an Opposition-based Learning Binary Bat Algorithm as the feature selection technique in the T-method. …”
    Conference Paper
  17. 17

    Evaluation of FCV and FCM clustering algorithms in cluster-based compound selection by Sinarwati, Mohamad Suhaili, Mohamad Nazim, Jambli

    Published 2011
    “…However, little research has been done on overlapping method fuzzy c-means (FCM) and fuzzy c-varieties (FCV) clustering algorithms in compound selection research. Therefore, these two clustering algorithms are implemented and the performance is analyzed based on the effectiveness of the clustering results in terms of mean intercluster molecular dissimilarity (MIMDS) where these results are compared with one another. …”
    Get full text
    Get full text
    Get full text
    Article
  18. 18

    A new ant based rule extraction algorithm for web classification by Ku-Mahamud, Ku Ruhana, Saian, Rizauddin

    Published 2011
    “…Using Classifier-based attribute subset selection will reduce more attributes, but sacrifice the performance of the classifier.A hybrid ant colony optimization with simulated annealing algorithm to discover rules from data is proposed.The simulated annealing technique will minimize the problem of low quality discovered rule by an ant in a colony.The best rule for a colony will then be chosen and later the best rule among the colonies will be included in the rule set.The best rule for a colony will then be chosen and later the best rule among the colonies will be included in the rule set.The rule set is arranged in decreasing order of generation.Thirteen data sets which consist of discrete and continuous data were used to evaluate the performance of the proposed algorithm in terms of accuracy, number of rules and number of terms in the rules.Experimental results obtained from the proposed algorithm are comparable to the results of the Ant-Miner algorithm in terms of rule accuracy but are better in terms of rule simplicity.…”
    Get full text
    Get full text
    Get full text
    Get full text
    Monograph
  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