Search Results - (( using interactive process 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 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
  5. 5

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

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

    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
  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 comparative study on testing optimization techniques with combinatorial interaction testing for optimizing software product line testing by Maidin, Nur Farrahin, Hassan, Sa’Adah, Baharom, Salmi, Md. Sultan, Abu Bakar

    Published 2025
    “…By using the best optimization algorithm with the optimum number of interaction strengths, the complexity of the SPL testing process could be reduced without prejudicing the quality of the software system itself.…”
    Get full text
    Get full text
    Get full text
    Article
  10. 10

    Effects of Different Superpixel Algorithms on Interactive Segmentations by Soo See, Chai, Luong Goh, Kok, Weng Ng, Giap, Muzaffar, Hamzah

    Published 2022
    “…Though employed as pre-processing step in many interactive segmentation algorithms, to date, no study has been conducted to assess the effects of such incorporations on the segmentation algorithms. …”
    Get full text
    Get full text
    Get full text
    Article
  11. 11

    Effects of Different Superpixel Algorithms on Interactive Segmentations by Goh, Kok Luong, Ng, Giap Weng, Muzaffar Hamzah, Chai, Soo See

    Published 2022
    “…Though employed as pre-processing step in many interactive segmentation algorithms, to date, no study has been conducted to assess the effects of such incorporations on the segmentation algorithms. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  12. 12

    Sizes of Superpixels and their Effect on Interactive Segmentation by Kok, Luong Goh, Giap, Weng Ng, Muzaffar Hamzah, Soo, See Chai

    Published 2021
    “…Despite the fact that it is used as a pre-processing step in many interactive segmentation algorithms, less studies had been conducted to assess the effects of the size of superpixels required by interactive segmentation algorithms to achieve an optimal result. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Proceedings
  13. 13

    Sizes of Superpixels and their Effect on Interactive Segmentation by Goh, Kok Luong, Ng, Giap Weng, Muzaffar, Hamzah, Chai, Soo See

    Published 2021
    “…Despite the fact that it is used as a pre-processing step in many interactive segmentation algorithms, less studies had been conducted to assess the effects of the size of superpixels required by interactive segmentation algorithms to achieve an optimal result. …”
    Get full text
    Get full text
    Get full text
    Proceeding
  14. 14

    Efficient prime-based method for interactive mining of frequent patterns. by Mohammad Hossein, Nadimi Shahraki, Mustapha, Norwati, Sulaiman, Md. Nasir, Mamat, Ali

    Published 2011
    “…During the mining process, the mining algorithm reduces the number of candidate patterns and comparisons by using a new candidate set called candidate head set and several efficient pruning techniques. …”
    Get full text
    Get full text
    Article
  15. 15

    VISUALIZATION OF GENETIC ALGORITHM BASED ON 2-D GRAPH TO ACCELERATE THE SEARCHING WITH HUMAN INTERVENTIONS. by FAROOQ, HUMERA

    Published 2012
    “…Visualization techniques help in understanding the searching behaviour of Genetic Algorithm. lt also makes possible the user interactions during the searching process. …”
    Get full text
    Get full text
    Thesis
  16. 16

    On Adopting Parameter Free Optimization Algorithms for Combinatorial Interaction Testing by Kamal Z., Zamli, Alsariera, Yazan A., Nasser, Abdullah B., Alsewari, Abdulrahman A.

    Published 2015
    “…Although useful, strategies based on the aforementioned optimization algorithms are not without limitation. …”
    Get full text
    Get full text
    Get full text
    Article
  17. 17

    SYSTEM IDENTIFICATION AND MODEL PREDICTIVE CONTROL FOR INTERACTING SERIES PROCESS WITH NONLINEAR DYNAMICS by SETYO WIBOWO, TRI CHANDRA

    Published 2009
    “…The study is carried out by experimental works using the gaseous pilot plant as the process. The gaseous pilot plant exhibits the typical dynamic of an interacting series process, where the strong interaction between upstream and downstream properties occurs in both ways. …”
    Get full text
    Get full text
    Thesis
  18. 18
  19. 19
  20. 20

    Superpixel Sizes using Topology Preserved Regular Superpixel Algorithm and their Impacts on Interactive Segmentation by Goh, Kok Luong, Chai, Soo See, Ng, Giap Weng, Muzaffar Hamzah

    Published 2022
    “…It is possible to speed up and improve the end result of segmentation by using pre-processing steps. The use of superpixels is an example of a pre-processing step. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Article