Search Results - (( initial optimization _ algorithm ) OR ( java application using 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
    “…The proposed algorithm is known as the enhance ant colony optimization (EACO). …”
    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
    “…Managing resources in grid computing system is complicated due to the distributed and heterogeneous nature of the resources.Stagnation in grid computing system may occur when all jobs require or are assigned to the same resources which lead to the resources having high workload or the time taken to process a job is high.This research proposes an Enhanced Ant Colony Optimization (EACO) algorithm that caters dynamic scheduling and load balancing in the grid computing system.The algorithm consists of three new mechanisms that organize the work of an ant colony i.e. initial pheromone value mechanism, resource selection mechanism and pheromone update mechanism.The resource allocation problem is modeled as a graph that can be used by the ant to deliver its pheromone.This graph consists of four types of vertices which are job, requirement, resource and capacity that are used in constructing the grid resource management element.The proposed EACO algorithm takes into consideration the capacity of resources and the characteristics of jobs in determining the best resource to process a job.EACO selects the resources based on the pheromone value on each resource which is recorded in a matrix form.The initial pheromone value of each resource for each job is calculated based on the estimated transmission time and execution time of a given job. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Monograph
  4. 4

    RSA Encryption & Decryption using JAVA by Ramli, Marliyana

    Published 2006
    “…References and theories to support the research of 'RSA Encryption/Decryption using Java' have been disclosed in Literature Review section. …”
    Get full text
    Get full text
    Final Year Project
  5. 5
  6. 6
  7. 7

    A near-optimal centroids initialization in K-means algorithm using bees algorithm by Mahmuddin, Massudi, Yusof, Yuhanis

    Published 2009
    “…The K-mean algorithm is one of the popular clustering techniques.The algorithm requires user to state and initialize centroid values of each group in advance. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  8. 8
  9. 9
  10. 10

    Real-Time Video Processing Using Native Programming on Android Platform by Saipullah, Khairul Muzzammil

    Published 2012
    “…However for the Android platform that based on the JAVA language, most of the software algorithm is running on JAVA that consumes more time to be compiled. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  11. 11
  12. 12

    Multistage optimal homotopy asymptotic method for solving initial-value problems by Anakira, N. R., Alomari, A. K., Jameela, Ali, Hashim, Ishak

    Published 2016
    “…In this paper, a new approximate analytical algorithm namely multistage optimal homotopy asymptotic method (MOHAM) is presented for the first time to obtain approximate analytical solutions for linear, nonlinear and system of initial value problems (IVPs).This algorithm depends on the standard optimal homotopy asymptotic method (OHAM), in which it is treated as an algorithm in a sequence of subinterval. …”
    Get full text
    Get full text
    Get full text
    Article
  13. 13

    A firefly algorithm based hybrid method for structural topology optimization by Gebremedhen, H.S., Woldemichael, D.E., Hashim, F.M.

    Published 2020
    “…The lower and upper limit of design variables (0 and 1) were used to find initial material distribution to initialize the firefly algorithm based section of the hybrid algorithm. …”
    Get full text
    Get full text
    Article
  14. 14
  15. 15
  16. 16
  17. 17
  18. 18
  19. 19
  20. 20

    Novel initialization strategy: Optimizing conventional algorithms for global maximum power point tracking by Al-Tawalbeh, Nedaa, Zafar, Muhammad Hamza, Mohd Radzi, Mohd Amran, Mohd Zainuri, Muhammad Ammirrul Atiqi, Al-Wesabi, Ibrahim

    Published 2024
    “…The major advantages of this approach are eliminating the need to modify the original algorithm, hybridizing with other algorithms, or employing any complex procedures, as in metaheuristic and optimization MPPT algorithms. …”
    Get full text
    Get full text
    Get full text
    Article