Search Results - (( java simulation optimization algorithm ) OR ( based computer work 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
    “…This research proposes an enhancement of the ant colony optimization algorithm that caters for dynamic scheduling and load balancing in the grid computing system. …”
    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
    “…This research proposes an Enhanced Ant Colony Optimization (EACO) algorithm that caters dynamic scheduling and load balancing in the grid computing system. …”
    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

    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

    Sketch-based 3D modeling of symmetric objects from wireframe sketches on paper by Yahya, Zahrah

    Published 2016
    “…Feature extraction is a preliminary step before 3D reconstruction and therefore, a junction detection algorithm is proposed. The presented algorithm benefits in omitting unnecessary junctions that are problematic for object recognition in comparison to the closest algorithm to our work. …”
    Get full text
    Get full text
    Thesis
  10. 10

    Hybrid test redundancy reduction strategy based on global neighborhood algorithm and simulated annealing by Kamal Z., Zamli, Norasyikin, Safieny, Fakhrud, Din

    Published 2018
    “…There are already many works in the literature exploiting the greedy computational algorithms as well as the meta-heuristic algorithms, but no single strategy can claim dominance in terms of test data reduction over their counterparts. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  11. 11
  12. 12
  13. 13
  14. 14

    An efficient VM scheduling algorithm to minimize the makespan and maximize the profit by Ibrahim, Aws Fadhil

    Published 2019
    “…The second process is hyper analytical task scheduling algorithm, and based on the scheduled task, the policy based profit maximization algorithm was proposed in final process. …”
    Get full text
    Get full text
    Thesis
  15. 15

    Local Stereo Matching Algorithm Using Modified Dynamic Cost Computation by Kadmin, Ahmad Fauzan, Hamzah, Rostam Affendi, Abd Manap, Nurulfajar, Hamid, Mohd Saad, Tg. Wook, Tg Mohd Faizal

    Published 2021
    “…Traditional framework composition consists of several constraints in stereo correspondences such as illumination variations in images and inadequate or non-uniform light due to uncontrollable environments. This work improves the local method stereo matching algorithm based on the dynamic cost computation method for depth measurement. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  16. 16
  17. 17

    Shunt active power filter using hybrid fuzzy-proportional and crisp-integral control algorithms for total harmonic distortion improvement by Abdul Rahman, Nor Farahaida

    Published 2016
    “…In previous work, an Adaptive Linear Neuron (ADALINE) based extraction algorithm has been developed to generate reference currents. …”
    Get full text
    Get full text
    Thesis
  18. 18
  19. 19

    Kernel and multi-class classifiers for multi-floor wlan localisation by Abd Rahman, Mohd Amiruddin

    Published 2016
    “…For fingerprint database optimisation, novel access point (AP) selection algorithms which are based on variant AP selection are investigated to improve computational accuracy compared to existing AP selection algorithms such as Max-Mean and InfoGain. …”
    Get full text
    Get full text
    Thesis
  20. 20

    A new cryptographic algorithm based on decomposition problem in elliptic curve cryptography / Hilyati Hanina Zazali by Hilyati Hanina, Zazali

    Published 2012
    “…It is a new approach which performs core operation using multiplication of points based in ECC. The algorithm explores computational advantages of computing cofactor number of points on E and it is computationally infeasible to obtain if the cofactor are large enough. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis