Search Results - (( _ processing problem algorithm ) OR ( java application during algorithm ))

Search alternatives:

Refine Results
  1. 1
    Object-Oriented Programming semantics representation utilizing agents

    Object-Oriented Programming semantics representation utilizing agents by Mohd Aris, Teh Noranis

    Published 2011
    “…Generally, these source codes go through the preprocessing, comparison, extraction, generate program semantics and classification processes. A formal algorithm that can be applied to any two related Java-based source codes examples is invented to generate the semantics of these source codes. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  2. 2
    SUDOKU HELPER

    SUDOKU HELPER by Abdul Razak, Muhammad Asyraf

    Published 2015
    “…In this paper research, author presents an algorithm to provide a tutorial for any Sudoku player who got stuck during the solving process. …”
    Get full text
    Get full text
    Final Year Project
    Save to List
    Saved in:
  3. 3
    Development of Simulated Annealing Based Scheduling Algorithm for Two Machines Flow Shop Problem

    Development of Simulated Annealing Based Scheduling Algorithm for Two Machines Flow Shop Problem by M., Muziana, Kamal Z., Zamli

    Published 2015
    “…Flow shop scheduling problems relates the generation of appropriate sequencing for processing of N machines in compliance with given processing sequence orders. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  4. 4
    Enhanced gravitational search algorithm for nano-process parameter optimization problem / Norlina Mohd Sabri

    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
    Save to List
    Saved in:
  5. 5
    DEVELOPMENT OF A MULTI-OBJECTIVE OPTIMZATION FRAMEWORK FOR INDUSTRIAL PROCESSES

    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
    Save to List
    Saved in:
  6. 6
    Parallel genetic algorithms for shortest path routing in high- performance computing / Mohd Erman Safawie Che Ibrahim

    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
    Save to List
    Saved in:
  7. 7
    Quantum Processing Framework And Hybrid Algorithms For Routing Problems

    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
    Save to List
    Saved in:
  8. 8
    Implication of image processing algorithm in remote sensing and GIS applications

    Implication of image processing algorithm in remote sensing and GIS applications by Pathan, Mubeena, Jusoff, Kamaruzaman, Mohd Sood, Alias, Razali, Yaakob, Qureshi, Barkatullah

    Published 2011
    “…An algorithm solves the complex problems more efficiently and consistently. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  9. 9
    Process Sequencing Modeled as TSP with Precedence Constraints - A Genetic Algorithm Approach

    Process Sequencing Modeled as TSP with Precedence Constraints - A Genetic Algorithm Approach by N. M., Razali

    Published 2014
    “…The process sequencing problem can be modeled as the travelling salesman problem with precedence constraints (TSPPC). …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  10. 10
    Monkey Algorithm for Packing Circles with Binary Variables

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

    Published 2019
    “…The algorithm consists of five main routines: the climb process, watch-jump process, repairing process, cooperation process and somersault process. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  11. 11
    Monkey Algorithm for Packing Circles with Binary Variables

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

    Published 2019
    “…The algorithm consists of five main routines: the climb process, watch-jump process, repairing process, cooperation process and somersault process. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  12. 12
    Talkout : Protecting mental health application with a lightweight message encryption

    Talkout : Protecting mental health application with a lightweight message encryption by Gavin Teo Juen

    Published 2022
    “…The investigation of lightweight message encryption algorithms is conducted with systematic quantitative literature and experiment implementation in Java and Android running environment. …”
    Get full text
    Get full text
    Get full text
    Academic Exercise
    Save to List
    Saved in:
  13. 13
    A hybrid kidney algorithm strategy for combinatorial interaction testing problem

    A hybrid kidney algorithm strategy for combinatorial interaction testing problem by Ameen Ali, Mohammed Ba Homaid

    Published 2022
    “…HKA addresses the limitations in KA by improving the algorithm's exploration and exploitation processes by hybridizing KA with mutation operator, and improve the balancing control process by enhancing the filtration process in KA. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  14. 14
    Biogeography based optimization (BBO) algorithm to minimise non-productive time during hole-making process

    Biogeography based optimization (BBO) algorithm to minimise non-productive time during hole-making process by Tamjidy, Mehran, Paslar, Shahla, Baharudin, B. T. Hang Tuah, Tang, Sai Hong, Mohd Ariffin, Mohd Khairol Anuar

    Published 2015
    “…This paper presents an evolutionary optimization algorithm based on geographic distribution of biological organism to deal with hole-making process problem. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  15. 15
    Optimization of multi-holes drilling path using particle swarm optimization

    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
    Save to List
    Saved in:
  16. 16
    Design of a flexible digital baseband signal processing algorithm

    Design of a flexible digital baseband signal processing algorithm by Mohamad, Rosalina, Harun, Harlisya, Nuzli, Mohamad Anas, Dimyati, Kaharudin

    Published 2006
    “…The work presented in this paper is aimed at designing a flexible digital baseband signal processing algorithm (DBSP) for satellite applications. …”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  17. 17
    Simulated Kalman Filter algorithms for solving optimization problems

    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
    Save to List
    Saved in:
  18. 18
    Approximate maximum clique algorithm (AMCA): A clever technique for solving the maximum clique problem through near optimal algorithm for minimum vertex cover problem

    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
    Save to List
    Saved in:
  19. 19
    Ant colony optimization based subset feature selection in speech processing: Constructing graphs with degree sequences

    Ant colony optimization based subset feature selection in speech processing: Constructing graphs with degree sequences by Rajesvary Rajoo R., Salam R.A.

    Published 2024
    journal::journal article
    Save to List
    Saved in:
  20. 20
    Hybridizing guided genetic algorithm and single-based metaheuristics to solve unrelated parallel machine scheduling problem with scarce resources

    Hybridizing guided genetic algorithm and single-based metaheuristics to solve unrelated parallel machine scheduling problem with scarce resources by Abed, Munther H., Mohd Nizam, Mohmad Kahar

    Published 2023
    “…When more resources are assigned to a job, the job processing time minimizes. However, the number of resources available is limited, and this makes the problem difficult to solve for a good quality solution. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:

Search Tools: