Search Results - (( simulation deviation selection 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

    Efficient Time-Varying q-Parameter Design for q-Incremental Least Mean Square Algorithm with Noisy Links by Arif, M., Khan, S.S., Qadri, S.S.U., Naseem, I., Moinuddin, M.

    Published 2022
    “…The analytical results are validated through simulation. Finally, extensive simulations have been done to evaluate the performance of the proposed algorithm for various choices of optimal q-values. …”
    Get full text
    Get full text
    Article
  5. 5

    Fault diagnostic algorithm for precut fractionation column by Heng, H. Y., Ali, Mohamad Wijayanuddin, Kamsah, Mohd. Zaki

    Published 2004
    “…Hazard and Operability Study (HAZOP) is used to support the diagnosis task. The algorithm has been successful in detecting the deviations of each variable by testing the data set. …”
    Get full text
    Get full text
    Conference or Workshop Item
  6. 6

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

    Development of a rule-based fault diagnostic advisory system for precut fractionation column by Heng, Han Yann

    Published 2005
    “…Although the scheme was developed based on data of fatty acid precut fractionation column, the algorithm of fault detection and diagnosis can be extended to other chemical process by changing the x-MR chart and HAZOP for each selected monitoring variables.…”
    Get full text
    Get full text
    Thesis
  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
  10. 10

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

    Dynamic Robust Bootstrap Algorithm for Linear Model Selection Using Least Trimmed Squares by Uraibi, Hassan Sami

    Published 2009
    “…The results on the model selection again signify that our proposed robust bootstrap model selection method is more robust than the classical bootstrap model selection.…”
    Get full text
    Get full text
    Thesis
  12. 12

    Fault diagnostic advisory system using moving-range chart and hazard operability study by Heng, Han Yann, Ali, Mohamed Wijayanuddin, Kamsah, Mohd. Zaki

    Published 2007
    “…Moving-Range (x-MR) Chart and HAZOP study were used to define the causes and consequences of process deviation based on selected parameter for each study node. …”
    Get full text
    Get full text
    Get full text
    Article
  13. 13

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

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

    Fault diagnostic advisory system using moving-range chart and hazard operability study. by Heng, Han Yann, Ali, Mohamad Wijayanuddin, Kamsah, Mohd Zaki

    Published 2007
    “…Moving-Range (x-MR) Chart and (HAZOP) study were used to define the causes and consequences of process deviation based on selected parameter for each study node. …”
    Get full text
    Get full text
    Article
  16. 16

    Penalized LAD-SCAD estimator based on robust wrapped correlation screening method for high dimensional models by Baba, Ishaq Abdullahi, Midi, Habshah, Leong, Wah June, Ibragimov, Gafurjan I.

    Published 2021
    “…The SIS method uses the rank correlation screening (RCS) algorithm in the pre-screening step and the traditional Pathwise coordinate descent algorithm for computing the sequence of the regularization parameters in the post screening step for onward model selection. …”
    Get full text
    Get full text
    Get full text
    Article
  17. 17

    LASSO-type estimations for threshold autoregressive and heteroscedastic time series models. by Muhammad Jaffri Mohd Nasir

    Published 2020
    “…Our simulation studies show that the ensemble wBCD-wBEA algorithm estimates the correct number of thresholds at a high percentage, and the biases in the empirical standard deviations for the estimated thresholds are small.…”
    Get full text
    Get full text
    UMK Etheses
  18. 18

    Non-probabilistic approach to cooperative position tracking in large swarm of simple mobile robots using triangular cross-observation by Din, Abdul Sattar

    Published 2013
    “…The performance of the algorithm was validated and compared against that of the EKF through series of simulations using Stage multi-agent simulator. …”
    Get full text
    Get full text
    Thesis
  19. 19

    A multi-objective portfolio selection model with fuzzy Value-at-Risk ratio by Wang, B., Li, Y., Wang, S., Watada, J.

    Published 2018
    “…Based on the two ratios, a multi-objective model is built to evaluate their joint impact on portfolio selection. Then the proposed model is solved by a fuzzy simulation-based multi-objective particle swarm optimization algorithm, where the global best of each iteration is determined by an improved dominance times-based method. …”
    Get full text
    Get full text
    Article
  20. 20

    A multi-objective portfolio selection model with fuzzy Value-at-Risk ratio by Wang, B., Li, Y., Wang, S., Watada, J.

    Published 2018
    “…Based on the two ratios, a multi-objective model is built to evaluate their joint impact on portfolio selection. Then the proposed model is solved by a fuzzy simulation-based multi-objective particle swarm optimization algorithm, where the global best of each iteration is determined by an improved dominance times-based method. …”
    Get full text
    Get full text
    Article