Search Results - (( java application optimization algorithm ) OR ( its selection problem algorithm ))

Refine Results
  1. 1

    Enhancement of Ant Colony Optimization for Grid Job Scheduling and Load Balancing by Husna, Jamal Abdul Nasir

    Published 2011
    “…The resource allocation problem is modeled as a graph that can be used by the ant to deliver its pheromone. …”
    Get full text
    Get full text
    Get full text
    Thesis
  2. 2

    Ant colony optimization algorithm for load balancing in grid computing by Ku-Mahamud, Ku Ruhana, Mohamed Din, Aniza

    Published 2012
    “…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. …”
    Get full text
    Get full text
    Get full text
    Monograph
  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

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

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

    Improved Salp Swarm Algorithm based on opposition based learning and novel local search algorithm for feature selection by Tubishat, Mohammad, Idris, Norisma, Shuib, Liyana, Abushariah, Mohammad A.M., Mirjalili, Seyedali

    Published 2020
    “…Two main improvements were included into the original SSA algorithm to alleviate its drawbacks and adapt it for feature selection problems. …”
    Get full text
    Get full text
    Article
  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

    Bats echolocation-inspired algorithms for global optimisation problems by Nafrizuan, Mat Yahya

    Published 2016
    “…The works related to swarm intelligence algorithms include the development of the algorithm itself, its modification and improvisation as well as its application in solving global optimisation problems. …”
    Get full text
    Get full text
    Thesis
  12. 12
  13. 13

    Feature selection and model selection algorithm using incremental mixed variable ant colony optimization for support vector machine classifier by Alwan, Hiba Basim, Ku-Mahamud, Ku Ruhana

    Published 2013
    “…In order to enhance SVM performance, these problems must be solved simultaneously because error produced from the feature subset selection phase will affect the values of the SVM parameters and resulted in low classification accuracy.Most approaches related with solving SVM model selection problem will discretize the continuous value of SVM parameters which will influence its performance.Incremental Mixed Variable Ant Colony Optimization (IACOMV) has the ability to solve SVM model selection problem without discretising the continuous values and simultaneously solve the two problems.This paper presents an algorithm that integrates IACOMV and SVM.Ten datasets from UCI were used to evaluate the performance of the proposed algorithm.Results showed that the proposed algorithm can enhance the classification accuracy with small number of features.…”
    Get full text
    Get full text
    Get full text
    Article
  14. 14
  15. 15

    Some metaheuristic algorithms for solving multiple cross-functional team selection problems by Ngo, S.T., Jaafar, J., Izzatdin, A.A., Tong, G.T., Bui, A.N.

    Published 2022
    “…The team selection problem has become more complicated in order to achieve multiple goals in its decision-making process. …”
    Get full text
    Get full text
    Article
  16. 16
  17. 17

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

    Adaptive differential evolution algorithm with fitness based selection of parameters and mutation strategies / Rawaa Dawoud Hassan Al-Dabbagh by Rawaa Dawoud Hassan, Al-Dabbagh

    Published 2015
    “…The performance of DE algorithm depends heavily on the selected mutation strategy and its associated control parameters. …”
    Get full text
    Get full text
    Thesis
  19. 19

    Metaheuristic algorithms for feature selection (2014–2024) by Faizan, Muhammad, Muhammad Arif, Mohamad

    Published 2025
    “…Metaheuristic algorithms are suited to provide solutions to feature selection problems because these problems are combinatorial and require an effective and efficient search through large solution spaces. …”
    Get full text
    Get full text
    Get full text
    Article
  20. 20

    Binary whale optimization algorithm with logarithmic decreasing time-varying modified sigmoid transfer function for descriptor selection problem by Yusof, Norfadzlia Mohd, Muda, Azah Kamilah, Pratama, Satrya Fajri, Carbo-Dorca, Ramon, Abraham, Ajith

    Published 2023
    “…The new Binary Whale Optimization Algorithm is integrated with wrapper feature selection and validated on descriptor selection problem to improve Amphetamine-type stimulants drug classification result. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item