Search Results - (( program implementation clustering algorithm ) OR ( problem implementation _ algorithm ))

Refine Results
  1. 1

    Parallel genetic algorithms for shortest path routing in high- performance computing / Mohd Erman Safawie Che Ibrahim by Che Ibrahim, Mohd Erman Safawie

    Published 2012
    “…This project focuses on step-up cluster computing and a parallel Genetic Algorithm. The objectives of this project to set-up Beowulf cluster computer to apply the Travelling Salesman Problem in parallel by using Genetic Algorithms and evaluate sequential algorithms and parallel algorithms by Genetic Algorithms. …”
    Get full text
    Get full text
    Thesis
  2. 2

    Efficient genetic partitioning-around-medoid algorithm for clustering by Garib, Sarmad Makki Mohammed

    Published 2019
    “…Besides, these algorithms more frequently implemented with the lengthy and redundant fixed N length integer encoding. …”
    Get full text
    Get full text
    Thesis
  3. 3

    Parallel Implementation of Two Level Barotropic Models Applied to the Weather Prediction Problem by Bahri, Susila

    Published 2004
    “…Then the parallel algorithms are constructed and run using the Beowulf Cluster machine. …”
    Get full text
    Get full text
    Thesis
  4. 4

    Enhancement of Ant System Algorithm for Course Timetabling Problem by Djamarus, Djasli

    Published 2009
    “…In order to develop a new algorithm for the course scheduling problem, this research follows the experimental research methodology that consist of problem analysis, designing algorithm, implementing algorithm as a computer program in order to examine the results, analyzing the results, and if necessary improving the algorithm by doing all those activities over and over again. …”
    Get full text
    Get full text
    Get full text
    Thesis
  5. 5

    An evaluation of Monte Carlo-based hyper-heuristic for interaction testing of industrial embedded software applications. by S. Ahmed, Bestoun, Enoiu, Eduard, Afzal, Wasif, Kamal Z., Zamli

    Published 2020
    “…Hyper-heuristic is a new methodology for the adaptive hybridization of meta-heuristic algorithms to derive a general algorithm for solving optimization problems. …”
    Get full text
    Get full text
    Get full text
    Article
  6. 6

    A Framework for Green Energy Resources Identification and Integration Supported by Real-Time Monitoring, Control, and Automation Applications by Far Chen, Jong

    Published 2025
    “…Following site identification, an improved Geographical Information System-driven fuzzy Traveling Salesman Problem-Binary Integer Programming algorithm was proposed to integrate these sites into a reliable ring-based system topology, aiming to achieve a zero-carbon footprint. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  7. 7
  8. 8
  9. 9

    Implementation of Hybrid Indexing, Clustering and Classification Methods to Enhance Rural Development Programme in South Sulawesi by Muhammad, Faisal

    Published 2024
    “…Village development and assistance program is a strategy implemented to accelerate socio cultural development to increase the capacity of village governance and more organized administration. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  10. 10
  11. 11

    Mathematical simulation for 3-dimensional temperature visualization on open source-based grid computing platform by Alias, Norma, Satam, Noriza, Abd. Ghaffar, Zarith Safiza, Darwis, Roziha, Hamzah, Norhafiza, Islam, Md. Rajibul

    Published 2009
    “…The development of this architecture is based on several programming language as it involves algorithm implementation on C, parallelization using Parallel Virtual Machine (PVM) and Java for web services development. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  12. 12

    Feature clustering for pso-based feature construction on high-dimensional data by Swesi, Idheba Mohamad Ali Omer, Abu Bakar, Azuraliza

    Published 2019
    “…The Redundancy-Based Feature Clustering (RFC) algorithm was applied to choose the most informative features from the original data, while PSO was used to construct new features from those selected by RFC. …”
    Get full text
    Get full text
    Get full text
    Article
  13. 13

    The Implementation of Genetic Algorithm in Path Optimization by Jumali, Suriana

    Published 2005
    “…In this project, TSP will be used to model and easy visualize the path optimization problem and Genetic Algorithm (GA) was chosen to be implemented in resolving the problem. …”
    Get full text
    Get full text
    Final Year Project
  14. 14

    Quantum Processing Framework And Hybrid Algorithms For Routing Problems by Soltan Aghaei, Mohammad Reza

    Published 2010
    “…These quantum algorithms can be applied to solve routing problem in the quantum networks and the quantum multicomputer. …”
    Get full text
    Get full text
    Thesis
  15. 15

    Low-level hybridization scripting language with dynamic parameterization in PSO-GA / Suraya Masrom by Masrom, Suraya

    Published 2015
    “…However, in many cases, implementing the suitable hybrid algorithms for a given optimization problem is a considerably difficult, which in most cases, is time consuming. …”
    Get full text
    Get full text
    Thesis
  16. 16

    Festive season balancing groceries optimization / Fairuz Mohamed Razi by Mohamed Razi, Fairuz

    Published 2012
    “…An Artificial Intelligence method or technique is selected to provide a solution to this problem. The cause of the shortage in supply-demand is taken to be implemented in the Genetic Algorithms optimization concepts. …”
    Get full text
    Get full text
    Thesis
  17. 17

    Chaotic Immune Symbiotic Organisms Search algorithm for solving optimisation problem by Zamani M.K.M., Musirin I., Suliman S.I., Mustaffa S.A.S.

    Published 2023
    “…Good performance of these heuristics-based algorithm has been implied through various implementation in solving optimisation problems. …”
    Article
  18. 18

    Enhancing Market-Based Scheduling Algorithm on Globally Distributed Web Servers Using Least Suitable Sealed Bid Technique by Al-Ewiwi, Mahmoud

    Published 2006
    “…Scheduling of a multiple distributed servers is considered as a complex problem.considered as NP-complete problem,where no single efficient algorithm guaranteed to produce optimal results.This thesis investigates on how to find optimal solution for distribute system,by implementing market based scheduling Algorithm(MBSA).On implementing the MBSA, a new auction technique which is the least suitable sealed bid auction will be introduced.it is found that least suitable sealed bid technique will give the close-to-optimum solution.In the implementation, cooperative agents were used as a middleware between web servers and stand-alone schedulers. …”
    Get full text
    Get full text
    Thesis
  19. 19

    An experiment on the performance of shortest path algorithm by Chan, Simon Yew Meng, Adnan, Nur’ayuni, Sukri, Syazwan Syafiqah, Wan Zainon, Wan Mohd Nazmee

    Published 2016
    “…The main objective of this paper is to study and experiment the different shortest path algorithm such as Dijkstra’s algorithm, Symmetrical Dijkstra’s algorithm, A* algorithm, Bellman-Ford algorithm, Floyd-Warshall algorithm and Genetic algorithm in solving the shortest path problem. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  20. 20

    An experimental study of neighbourhood based metaheuristic algorithms for test case generation satisfying the modified condition / decision coverage criterion by Haque, Ariful

    Published 2018
    “…We have chosen four neighborhood based algorithms which are commonly used in optimization problems and divided them in newly implemented and re-implemented category. …”
    Get full text
    Get full text
    Thesis