Search Results - (( programming assignment computational algorithm ) OR ( java application testing algorithm ))

Refine Results
  1. 1

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

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

    System program management environment in cloud computing using hybrid Genetic Algorithm and Moth Flame Optimization (GA-MFO) by Mohd Erwan Mazalan

    Published 2022
    “…This project present a system program algorithm based on Moth Flame Optimization (MFO) algorithm to assign an optimal set of system program to meet the satisfaction of quality of service requirements of cloud computing in such a way that the total execution time of tasks is minimized. …”
    Get full text
    Get full text
    Get full text
    Academic Exercise
  4. 4
  5. 5

    CSC126 - Fundamentals of Algorithms and Computer Problem Solving / Faculty of Computer And Mathematical Sciences by UiTM, Faculty of Computer And Mathematical Sciences

    Published 2023
    “…This course is an introduction to problem solving using a computer programming language. It emphasizes on algorithm development and writing computer programs, as well as common good practices in writing programs. …”
    Get full text
    Get full text
    Get full text
    Teaching Resource
  6. 6
  7. 7

    Graph coloring program of exam scheduling modeling based on bitwise coloring algorithm using python by Arifin, Samsul, Muktyas, Indra Bayu, Al Maki, Wikky Fawwaz, Mohd Khairul Bazli, Mohd Aziz

    Published 2022
    “…In this article, the researchers design an algorithm and apply it to a computer program (Python) to solve graph coloring and to visualize the variation of exam scheduling modeling at Binus University in graphs based on the Bitwise Graph Coloring Algorithm. …”
    Get full text
    Get full text
    Get full text
    Article
  8. 8

    A mixed integer linear programming model for real-time task scheduling in multiprocessor computer system by Oluwadare, Samuel Adeboyo, Akinnuli, Basil Oluwafemi

    Published 2012
    “…The advent of multi-processor systems offers a more efficient way of processing multimedia data in real-time.With the development of appropriate scheduling algorithm, another challenge is the mode of assigning tasks in multi-processor systems.This calls for the use of an appropriate mathematical model that will take cognizance of the nature of variables involved.In this research work, a Mixed Integer Linear Programming Model (MILP) was developed to assign tasks in a multiprocessor system.The MILP model was used to assign tasks to multi-processor systems ranging between 5 and 10 homogeneous processors.The result of the simulation runs shows that with the appropriate scheduling algorithm, a high success rate ratio and guaranteed number of deadlines met could be achieved.…”
    Get full text
    Get full text
    Get full text
    Article
  9. 9

    Optimal assignments of versions to processors in fault-tolerant computer systems by Leow, Soo Kar, McAllister, David F.

    Published 1988
    “…This paper addresses the problem of assigning n independently developed version of a program to n different computers to maximize system reliability. …”
    Get full text
    Get full text
    Article
  10. 10

    CSC099: Foundation Computing II / Centre of Foundation Studies by UiTM, Centre of Foundation Studies

    Published 2022
    “…This course introduces basic computer programming algorithm, problem solving, structured programming language, selection structure, repetition structure, function and array. …”
    Get full text
    Get full text
    Get full text
    Teaching Resource
  11. 11

    RSA Encryption & Decryption using JAVA by Ramli, Marliyana

    Published 2006
    “…The implementation of this project will be based on Rapid Application Design Methodology (RAD) and will be more focusing on research and finding, ideas and the implementation of the algorithm, and finally running and testing the algorithm. …”
    Get full text
    Get full text
    Final Year Project
  12. 12

    Local search heuristics for elective surgery scheduling considering patient urgency by Rashid, N. S. A., Rahmin, N. A. A., Leong, W. J., Mohamed Ali, Nazihah

    Published 2019
    “…Our aim is to maximize the sum of the urgency values assigned to each surgery. An integer linear programming model is referred to solve the problem. …”
    Get full text
    Get full text
    Get full text
    Article
  13. 13
  14. 14
  15. 15
  16. 16
  17. 17

    Optimization Of Two-Dimensional Dual Beam Scanning System Using Genetic Algorithms by Koh, Johnny Siaw Paw

    Published 2008
    “…The representation approach has been implemented via a computer program in order to achieve optimized scanning performance. …”
    Get full text
    Get full text
    Thesis
  18. 18

    An improved algorithm for channel allocation on direct sequence spread spectrum by Handrizal, M

    Published 2011
    “…Welsh Powell algorithm is an algorithm that tries to solve the graph coloring problem.Dsatur algorithm is an algorithm coloring sorted by building sequence of vertices dynamically.However,these algorithms have its weaknesses in terms of the minimum number of channel required.In this study,channel allocation called Vertex Merge Algorithm (VMA) is proposed with aim to minimize number of required channels.It is based on the logical structure of vertex in order to a coloring the graph.Each vertex on the graph arranged based on decreasing number of degree.The vertex in the first place on the set gives a color,and then this vertex is merged with non-adjacent vertex.This process is repeatedly until all vertices colored.The assignment provides a minimum number of channels required.A series of an experiment was carried out by using one computer.Vertex Merge Algorithm (VMA) simulation is developed under Linux platform.It was carried out in Hypertext Preprocessor (PHP) programming integrated with GNU Image Manupulation Program (GIMP) for open and edit image.The experimental results show that the proposed algorithm work successfully in channel allocation on DSSS with the minimum of channels required.The average percentage reduction in the number of required channels among the VMA, Dsatur algorithm and Welsh Powell algorithm in the simple graph is equivalent to 0.0%. …”
    Get full text
    Get full text
    Thesis
  19. 19

    Image classification using two dimensional wavelet coefficients with parallel computing by Ong, Yew Fai

    Published 2020
    “…With the aid of parallel processing method introduced in this research, both central processing core units and graphic card receive a different program instruction to execute the task assigned to them simultaneously. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
  20. 20

    Comparison of Search Algorithms in Javanese-Indonesian Dictionary Application by Yana Aditia, Gerhana, Nur, Lukman, Arief Fatchul, Huda, Cecep Nurul, Alam, Undang, Syaripudin, Devi, Novitasari

    Published 2020
    “…Performance Testing is used to test the performance of algorithm implementations in applications. …”
    Get full text
    Get full text
    Journal