Search Results - (( risk iteration method 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

    DESIGN AND IMPLEMENTATION OF RIPEMD-160 HASH FUNCTION USING VERILOG HDL by Sharifah Azizah, Wan Alwi

    Published 2022
    “…This project proposes to design an iterative method of RIPEMD-160 in order to investigate the security algorithm and its implementation. …”
    Get full text
    Get full text
    Final Year Project Report / IMRAD
  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

    Em Approach on Influence Measures in Competing Risks Via Proportional Hazard Regression Model by Elfaki, Faiz. A. M.

    Published 2000
    “…These estimates were then compared to the Newton-Raphson iteration method. A generated data where the failure times were taken as exponentially distributed was used to further compare these two methods of estimation. …”
    Get full text
    Get full text
    Thesis
  8. 8

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

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

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

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

    Published 2018
    “…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
  12. 12

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

    Published 2018
    “…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
  13. 13

    Full waveform inversion based on genetic local search algorithm with hybrid-grid scheme by Hamamoto, M., Rahim Md Arshad, A., Prasad Ghosh, D.

    Published 2019
    “…Therefore, we propose an FWI method based on genetic local search algorithm with hybrid-grid scheme (HGLS-FWI). …”
    Get full text
    Get full text
    Conference or Workshop Item
  14. 14

    An Integrated RRT*SMART-A* Algorithm for solving the Global Path Planning Problem in a Static Environment by Suwoyo, Heru, Adriansyah, Andi, Andika, Julpri, Ubaidillah, Abu

    Published 2023
    “…This combination is intended to switch method-by-method for the exploration process when the new node reaches the region around the goal node. …”
    Get full text
    Get full text
    Get full text
    Article
  15. 15

    AN INTEGRATED RRT*SMART-A* ALGORITHM FOR SOLVING THE GLOBAL PATH PLANNING PROBLEM IN A STATIC ENVIRONMENT by SUWOYO, HERU, ADRIANSYAH, ANDI, ANDIKA, JULFRI, SHAMSUDIN, ABU UBAIDAH, ZAKARIA, MOHAMAD FAUZI

    Published 2023
    “…This combination is intended to s v1/4 itch method-by -method for the exploration process vyhen the new node reaches the region around the goal node. …”
    Get full text
    Get full text
    Get full text
    Article
  16. 16

    AN INTEGRATED RRT*SMART-A* ALGORITHM FOR SOLVING THE GLOBAL PATH PLANNING PROBLEM IN A STATIC ENVIRONMENT by Suwayo, Heri, Adrishah, Andi, Andika, Juleri, Shamdudin, Abu Ubaidah, Zakaria, Mohamad Fauzi

    Published 2023
    “…This combination is intended to s v1/4 itch method-by -method for the exploration process vyhen the new node reaches the region around the goal node. …”
    Get full text
    Get full text
    Get full text
    Article
  17. 17

    AN INTEGRATED RRT*SMART-A* ALGORITHM FOR SOLVING THE GLOBAL PATH PLANNING PROBLEM IN A STATIC ENVIRONMENT by SUWOYO, HERU, ADRIANSHAH, ANDI, ANDIKA, JULPRI, SHAMSUDIN, ABU UBAIDAH, ZAKARIA, MOHAMAD FAUZI

    Published 2023
    “…This combination is intended to s v1/4 itch method-by -method for the exploration process vyhen the new node reaches the region around the goal node. …”
    Get full text
    Get full text
    Get full text
    Article
  18. 18

    Slice sampler and metropolis hastings approaches for bayesian analysis of extreme data by Rostami, Mohammad

    Published 2016
    “…A simulation study shows that the slice sampler algorithm provides posterior means with low errors for the parameters along with a high level of stationarity in iteration series. …”
    Get full text
    Get full text
    Thesis
  19. 19

    Scaled Conjugate Gradient using strong Wolfe line search for portfolio selection / Nurfatihah Anizan by Anizan, Nurfatihah

    Published 2024
    “…In order to find the best method, the iteration number (NOI) and CPU time are computed. …”
    Get full text
    Get full text
    Thesis
  20. 20

    An eigenspace approach for detecting multiple space-time disease clusters: Application to measles hotspots detection in khyber-pakhtunkhwa, Pakistan by Ullah, S., Daud, H., Dass, S.C., Hadi, F.-T., Khalil, A.

    Published 2018
    “…We propose an extension of the EigenSpot algorithm, called Multi-EigenSpot that is able to handle multiple hotspots by iteratively removing previously detected hotspots and re-running the algorithm until no more hotspots are found. …”
    Get full text
    Get full text
    Article