Search Results - (( using processing (problems OR problem) algorithm ) OR ( java application mmla algorithm ))

Refine Results
  1. 1

    Approximate maximum clique algorithm (AMCA): A clever technique for solving the maximum clique problem through near optimal algorithm for minimum vertex cover problem by Fayaz, Muhammad, Arshad,, Shakeel, Shah,, Abdul Salam, Shah, Asadullah

    Published 2018
    “…Background and Objective: The process of solving the Maximum Clique (MC) problem through approximation algorithms is harder, however, the Maximum Vertex Cover (MVC) problem can easily be solved using approximation algorithms. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  2. 2

    Optimization of multi-holes drilling path using particle swarm optimization by Najwa Wahida, Zainal Abidin

    Published 2022
    “…One way to improve the multi-hole drilling is by optimising the tool path in the process. This research aims to model and optimise multi-hole drilling problems using Particle Swarm Optimisation (PSO) algorithm. …”
    Get full text
    Get full text
    Thesis
  3. 3

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

    Monkey Algorithm for Packing Circles with Binary Variables by Torres-Escobar, R., Marmolejo-Saucedo, J.A., Litvinchev, I., Vasant, P.

    Published 2019
    “…In this paper the problem of packing non-congruent circles is solved using the binary version of monkey algorithm. …”
    Get full text
    Get full text
    Article
  5. 5

    Monkey Algorithm for Packing Circles with Binary Variables by Torres-Escobar, R., Marmolejo-Saucedo, J.A., Litvinchev, I., Vasant, P.

    Published 2019
    “…In this paper the problem of packing non-congruent circles is solved using the binary version of monkey algorithm. …”
    Get full text
    Get full text
    Article
  6. 6

    DEVELOPMENT OF A MULTI-OBJECTIVE OPTIMZATION FRAMEWORK FOR INDUSTRIAL PROCESSES by GANESAN, TIMOTHY

    Published 2014
    “…Thus, this work focuses on industrial MO problems encountered in process engineering with more than two objectives. …”
    Get full text
    Get full text
    Thesis
  7. 7

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

    Published 2010
    “…A typical component in QPU is a quantum device that runs quantum algorithms; namely Quantum Algorithm Processing Unit (QAPU). …”
    Get full text
    Get full text
    Thesis
  8. 8

    Particle swarm optimization (PSO) for CNC route problem by Nur Azia Azwani, Ismail

    Published 2002
    “…We often see many of the method of Genetic Algorithm (GA), Ant Colony Optimization (ACO), Simulated Annealing Algorithm (SAA) and PSO are used for any optimization problems. …”
    Get full text
    Get full text
    Undergraduates Project Papers
  9. 9

    Simulated Kalman Filter algorithms for solving optimization problems by Nor Hidayati, Abdul Aziz

    Published 2019
    “…In principle, the optimization problem is regarded as a state estimation process. …”
    Get full text
    Get full text
    Thesis
  10. 10

    Investigation of evolutionary multi-objective algorithms in solving view selection problem / Seyed Hamid Talebian by Talebian, Seyed Hamid

    Published 2013
    “…In this research, we showed how evolutionary multi-objective algorithms can be used to solve the view selection problem and its advantage over classical optimization problems were described. …”
    Get full text
    Get full text
    Thesis
  11. 11

    Bees algorithm for Forest transportation planning optimization in Malaysia by Jamaluddin, Jamhuri, Kamarudin, Norizah, Ismail, Mohd Hasmadi, Ahmad, Siti Azfanizam

    Published 2021
    “…Algorithm is widely used in various areas due to its ability to solve classes of problems. …”
    Get full text
    Get full text
    Article
  12. 12

    Optimization of multi-holes drilling toolpath using tiki-taka algorithm by Norazlina, Abdul Rahman

    Published 2024
    “…The study aims to model the MDMT toolpath using the Traveling Salesman Problem (TSP) concept, apply TTA to optimize this model, and validate the model and algorithm through machining experiments on this problem. …”
    Get full text
    Get full text
    Thesis
  13. 13

    Diagnosis of eyesight using Improved Clonal Selection Algorithm (ICLONALG) / Nor Khirda Masri by Masri, Nor Khirda

    Published 2017
    “…This study aims to implement the classification algorithm using the Improved Clonal Selection Algorithm (ICLONALG) to classify the eyesight’s problems. …”
    Get full text
    Get full text
    Thesis
  14. 14

    Optimization Of Bar Linkage By Using Genetic Algorithms by Ramasamy, Mugilan

    Published 2005
    “…It is well known that GAs is best suited for unconstrained optimization problems. Optimization process will consider, lightest weight of the bar by using GAs without exceeding the allowable stress determined. …”
    Get full text
    Get full text
    Monograph
  15. 15

    Optimization of mycelium growth using genetic algorithm for multi-objective functions by Muhamad Faiz, Abu Bakar

    Published 2019
    “…Trade-off between the objectives, exist for the optimization process. To solve this issues, multi-objective genetic algorithm was chosen as the methodology for this project, specifically using NSGA-ii algorithm. …”
    Get full text
    Get full text
    Get full text
    Undergraduates Project Papers
  16. 16

    Genetic Algorithm for vehicle routing problem / W.Nurfahizul Ifwah W.Alias, Mohd Shaiful Sharipudin and Shamsunarnie Mohamed Zukri. by W.Alias, W.Nurfahizul Ifwah, Sharipudin, Mohd Shaiful, Mohamed Zukri, Shamsunarnie

    Published 2012
    “…In brief, GA is a system developing methods that use the natural principle of a genetic population and involved three main processes that is crossover, mutation and inversion. …”
    Get full text
    Get full text
    Research Reports
  17. 17

    A genetic algorithm to minimise the maximum lateness on a single machine family scheduling problem by Lee, Lai Soon, Nazif, Habibeh

    Published 2009
    “…In this study, we propose an Optimised Crossover Genetic Algorithm (OCGA) for the problem. The objective is to find a schedule which minimises the maximum lateness of the jobs in the presence of the sequence independent family setup times.In brief, the proposed OCGA uses binary representation to encode the problem. …”
    Get full text
    Conference or Workshop Item
  18. 18

    Enhanced gravitational search algorithm for nano-process parameter optimization problem / Norlina Mohd Sabri by Mohd Sabri, Norlina

    Published 2020
    “…Based on the capabilities of the metaheuristic algorithms, this research is proposing the enhanced Gravitational Search Algorithm (eGSA) to solve the nano-process parameter optimization problem. …”
    Get full text
    Get full text
    Thesis
  19. 19

    Generic DNA encoding design scheme to solve combinatorial problems by Rofilde, Hasudungan

    Published 2015
    “…Using this encoding scheme would enable researchers to solve other hard problems whilst also improving the algorithm.…”
    Get full text
    Get full text
    Thesis
  20. 20

    Parallel metaheuristic algorithm for route planning using CUDA by Looi, Daniel Jun Jie

    Published 2025
    “…Area of Study: Massively Parallel Computing, Combinatorial Optimization Keywords: Parallel Metaheuristic Algorithm, Travelling Salesman Problem, CUDA, GPU, Genetic Algorithm…”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis