Search Results - (( java application optimization algorithm ) OR ( using computing new 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
    “…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
  5. 5
  6. 6

    Performance evaluation of real-time multiprocessor scheduling algorithms by Alhussian, H., Zakaria, N., Abdulkadir, S.J., Fageeri, S.O.

    Published 2016
    “…These results suggests that optimal algorithms may turn to be non-optimal when practically implemented, unlike USG which reveals far less scheduling overhead and hence could be practically implemented in real-world applications. …”
    Get full text
    Get full text
    Conference or Workshop Item
  7. 7

    Route Optimization System by Zulkifli, Abdul Hayy

    Published 2005
    “…After much research into the many algorithms available, and considering some, including Genetic Algorithm (GA), the author selected Dijkstra's Algorithm (DA). …”
    Get full text
    Get full text
    Final Year Project
  8. 8
  9. 9
  10. 10

    Computer Lab Timetabling Using Genetic Algorithm Case Study - Unit ICT by Abdullah, Amran

    Published 2006
    “…Genetic Algorithm is one of the most popular optimization solutions used in various applications such as scheduling. …”
    Get full text
    Get full text
    Thesis
  11. 11
  12. 12

    Examination timetabling using genetic algorithm case study: KUiTTHO by Mohd Salikon, Mohd Zaki

    Published 2005
    “…Genetic Algorithm (GA) is one of the most popular optimization solutions. …”
    Get full text
    Get full text
    Thesis
  13. 13

    New signed-digit {0,1,3}-NAF scalar multiplication algorithm for elliptic curve over binary field by Md Yasin, Sharifah

    Published 2011
    “…The special NAF property is adopted in the new {0,1,3}-NAF scalar. Also, a new point tripling formula and algorithm are introduced for elliptic curve over binary field using Lopez-Dahab projective coordinates. …”
    Get full text
    Get full text
    Thesis
  14. 14

    Examination Timetabling Using Genetic Algorithm Case Study : KUiTTHO by Mohd. Zaki, Mohd. Salikon

    Published 2005
    “…Genetic Algorithm (GA) is one of the most popular optimization solutions. …”
    Get full text
    Get full text
    Get full text
    Thesis
  15. 15

    Extended development of a Computer Aided Detection (CAD) system for brain bleed in CT / Muhammad Illyas Abdul Muhji by Muhammad Illyas, Abdul Muhji

    Published 2018
    “…Then the new rotation angle is used to detect bleeding in the patient and evaluate the performance of the new algorithm. …”
    Get full text
    Get full text
    Thesis
  16. 16

    Improving Class Timetabling using Genetic Algorithm by Qutishat, Ahmed Mohammed Ali

    Published 2006
    “…We have targeted the research on class timetabling problem. Hence, Genetic Algorithm (GA) is used as one of the most popular optimization solutions. …”
    Get full text
    Get full text
    Get full text
    Thesis
  17. 17

    Enhanced algorithms for three-dimensional object interpreter by Haron, Habibollah

    Published 2004
    “…Besides reducing the number of image regularities used and new method to solve the linear system, this study has proposed better solutions in terms of an enhanced thinning algorithm, a modified Freeman chain code algorithm as picture description language, and a new computational comer detection algorithm.…”
    Get full text
    Get full text
    Get full text
    Thesis
  18. 18

    Multi-base number representation in application to scalar multiplication and pairing computation by Mohammed Ismail, Abdelwahed

    Published 2011
    “…Multi-bases number representation is used to construct new versions of Miller’s algorithm. …”
    Get full text
    Get full text
    Thesis
  19. 19

    An efficient computation technique for cryptosystems based on Lucas functions by Md Ali, Zulkarnain, Othman, Mohamed, Md. Said, Mohamad Rushdan, Sulaiman, Md. Nasir

    Published 2008
    “…We have found that the binary sequence used in a new algorithm is shorter than a special sequence used in an existing algorithm. …”
    Get full text
    Get full text
    Conference or Workshop Item
  20. 20