Search Results - (( using processing problem algorithm ) OR ( java location based algorithm ))

Refine Results
  1. 1
  2. 2
  3. 3

    Group formation using genetic algorithm by Che Ani, Zhamri, Husin, Mohd Zabidin, Yasin, Azman

    Published 2009
    “…However, due to lack of programming skills especially in Java programming language and the inability to have meetings frequently among the group members,most of the students’ software project cannot be delivered successfully.To solve this problem, systematic group formation is one of the initial factors that should be considered to ensure that every group consists of quality individuals who are good in Java programming and also to ensure that every group member in a group are staying closer to each other.In this research, we propose a method for group formation using Genetic Algorithms, where the members for each group will be generated based on the students’ programming skill and location of residential colleges.…”
    Get full text
    Get full text
    Get full text
    Get full text
    Monograph
  4. 4

    Multi-floor indoor location estimation system based on wireless local area network by Chua, Tien Han

    Published 2007
    “…The most probable match is selected and returned as estimated location based on Bayesian filtering algorithm. Estimated location is reported as physical location and symbolic location. …”
    Get full text
    Get full text
    Thesis
  5. 5
  6. 6

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

    Campus safe: Safeguarding GPS-based Physical Identity and Access Management (PIAM) system with a lightweight Geo-Encryption by Yeo Zi Zian

    Published 2022
    “…Subsequently, this project embedded with a lightweight Geo-Encryption algorithm to preserve the privacy of real-time GPS location. …”
    Get full text
    Get full text
    Get full text
    Academic Exercise
  8. 8

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

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

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

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

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

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

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

    Fuzzy modeling using Bat Algorithm optimization for classification by Noor Amidah, Ahmad Sultan

    Published 2018
    “…In order to create parameters, there are many problems arise in the process of fuzzy modeling. The problems are data incomplete and the size of the data is large. …”
    Get full text
    Get full text
    Get full text
    Undergraduates Project Papers
  16. 16

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

    Published 2006
    “…In this paper, we show how we solved the problem by satisfying several requirements simultaneously: 1) removing loop or complicated algorithm in DBSP functions with flexible DBSP algorithm 2) using DSP-BIOS Scheduling module to increase performance and make sure our sample data are in packed. …”
    Get full text
    Get full text
    Conference or Workshop Item
  17. 17

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

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

    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