Search Results - (( java application testing algorithm ) OR ( new generation method algorithm ))

Refine Results
  1. 1

    Design and development of an intuitive desktop application for rapid SARS-CoV-2 diagnosis using electrochemical potentiostat by Assaig, Faisal Ahmed, Gunawan, Teddy Surya, Nordin, Anis Nurashikin, Ab Rahim, Rosminazuin, Mohd Zain, Zainiharyati

    Published 2023
    “…Our primary focus revolved around creating a user-friendly desktop application, seamlessly integrating an algorithm that automates result generation for operators. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Proceeding Paper
  2. 2

    RSA Encryption & Decryption using JAVA by Ramli, Marliyana

    Published 2006
    “…The implementation of this project will be based on Rapid Application Design Methodology (RAD) and will be more focusing on research and finding, ideas and the implementation of the algorithm, and finally running and testing the algorithm. …”
    Get full text
    Get full text
    Final Year Project
  3. 3

    The normalized random map of gradient for generating multifocus image fusion by Ismail, ., Kamarul Hawari, Ghazali

    Published 2020
    “…Many researchers have developed many new and sophisticated methods. They show complicated computation and algorithm. …”
    Get full text
    Get full text
    Get full text
    Article
  4. 4

    Comparison of Search Algorithms in Javanese-Indonesian Dictionary Application by Yana Aditia, Gerhana, Nur, Lukman, Arief Fatchul, Huda, Cecep Nurul, Alam, Undang, Syaripudin, Devi, Novitasari

    Published 2020
    “…Performance Testing is used to test the performance of algorithm implementations in applications. …”
    Get full text
    Get full text
    Journal
  5. 5

    SEALiP: A simple and efficient algorithm for listing permutation via starter set method by Ibrahim, Haslinda, Zake, Lugean, Omar, Zurni, Karim, Sharmila

    Published 2013
    “…In order to demonstrate the algorithm, we are keen to list the permutations with the special references for cases of three and four objects.Based on this algorithm, a new method for listing permutations is developed and analyzed.This new permutation method will be compared with the existing lexicographic method.The results revealed that this new method is more efficient in terms of computation time.…”
    Get full text
    Get full text
    Get full text
    Article
  6. 6

    A New Approach To The Solution Of Economic Dispatch Using Genetic Algorithm by Al-Shetwi, Ali Q., Alomoush, Muwaffaq I.

    Published 2016
    “…The MATLAB simulation is run to demonstrate clearly the effectiveness of the new genetic algorithm approach as a very important method in the solution of economic dispatch problems.…”
    Get full text
    Get full text
    Get full text
    Article
  7. 7

    A new piston referencing algorithm for qualitative assessment of free-piston engine generator performance by Mohd Razali, Hanipah, M. Haziq Adham, Rosli, A. R., Razali

    Published 2021
    “…Free-piston engine generator (FPEG) provides a novel method for electrical power generation in hybrid electric vehicle applications. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  8. 8

    Generation of new low-complexity March algorithms for optimum faults detection in SRAM by Jidin, Aiman Zakwan, Hussin, Razaidi, Lee, Weng Fook, Mispan, Mohd Syafiq, Zakaria, Nor Azura, Loh, Wan Ying, Zamin, Norshuhani

    Published 2023
    “…This article presents a method to generate new March algorithms that provide optimum coverage on faults introduced by the nanometer process technologies. …”
    Get full text
    Get full text
    Get full text
    Article
  9. 9

    Comparison between starter sets generation method for listing all permutations by Karim, Sharmila, Ibrahim, Haslinda, Omar, Zurni

    Published 2013
    “…distinct permutations is an exhaustive process.Using starter set, the process of listing the permutations becomes easy.However a problem arises when the equivalence starter sets will generate the similar permutation and needed to be discarded.Two new recursive strategies are proposed to generate starter sets without generating equivalence starter sets namely circular and exchange two elements operation.Once the starter sets are obtained, the circular and reverse of circular operation are employed to produce distinct permutation from each starter sets.Computational advantages are presented comparing the results obtained by the new method with two other existing methods.The result indicates that the exchange two elements based strategy is faster than the circular based.Overall all new algorithms are better than existing algorithms in time execution.…”
    Get full text
    Get full text
    Conference or Workshop Item
  10. 10

    Opposition-based Whale Optimization Algorithm by Alamri, Hammoudeh S., Alsariera, Yazan A., Kamal Z., Zamli

    Published 2018
    “…In order to improve solution accuracy and reliability, this paper proposes a new algorithm based on WOA. The new algorithm called Opposition-based Whale Optimization (OWOA). …”
    Get full text
    Get full text
    Get full text
    Article
  11. 11
  12. 12
  13. 13

    Implementation of (AES) Advanced Encryption Standard algorithm in communication application by Moh, Heng Huong

    Published 2014
    “…The concept of ABS algorithm was firstly studied, including the definition, historical background, and a brief comparison was made between the ABS algorithm with other types of algorithm. …”
    Get full text
    Get full text
    Undergraduates Project Papers
  14. 14

    Augmentation of basic-line-search and quick-simplex-method algorithms to enhance linear programming computational performance by Nor Azlan, Nor Asmaa Alyaa

    Published 2021
    “…The thesis was set to three objectives as follows; to develop a new augmentation algorithm of Simplex method from the existed augmentation studies; to integrate the superiorities of the QSM and BLSA algorithms that can enhance computational performance; to compare the performance of the new augmentation algorithm with the conventional Simplex, QSM and BLSA in reducing iteration number. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  15. 15

    Taguchi-Grey Relational Analysis Method for Parameter Tuning of Multi-objective Pareto Ant Colony System Algorithm by Muthana, Shatha Abdulhadi, Ku Mahamud, Ku Ruhana

    Published 2023
    “…The gray relational grade (GRG) performance metric and the Friedman test were used to evaluate the algorithm’s performance. The Taguchi-GRA method that produced the new values for the algorithm’s parameters was shown to be able to provide a better multi-objective generator maintenance scheduling (GMS) solution. …”
    Get full text
    Get full text
    Get full text
    Article
  16. 16

    Enhance efficiency of answering XML keyword query using incompact structure of MCCTree by Sazaly, Ummu Sulaim

    Published 2012
    “…This study proposes a new algorithm, namely XMCCTreeGenerator, to enhance the efficiency of the CGTree- MCCTreeGenerator. …”
    Get full text
    Get full text
    Thesis
  17. 17
  18. 18
  19. 19

    Developing triad design algorithms based on compatible factorization by Ibrahim, Haslinda, Omar, Zurni, Abdul Rahim, Rahela

    Published 2011
    “…These processes have helped us develop algorithm for triad design, the objective of this study.A new technique for triad design algorithm, known as Interval Generation Method was employed to construct TD(6n + 1) and TD(6n + 5).This method depends on analyzing the pattern of triples in the design to build starters.We begin by producing starters from Interval Generation Method as the initial block to begin with.Then the algorithm begins by cycling modular v from the initial block and finishes when the process approaches the initial block.The algorithms for TD(6n+1) and TD(6n+5) are presented in Chapter 4 and 5, respectively.As the entire study depends mainly on TD(v) algorithms, new and remarkable theorems and lemmas for TD(v) development are presented and proved.…”
    Get full text
    Get full text
    Get full text
    Monograph
  20. 20

    Identification of Freeform Depression Feature in a Part Using Vertex Attributes From Feature Volume / Pramod S Kataraki and Mohd Salman Abu Mansor by Kataraki, Pramod S, Abu Mansor, Mohd Salman

    Published 2018
    “…Second, the inner loop of each face having depression feature is covered by generating a new face. Third, a lofting operation is performed between new faces to generate feature volume for the depression feature and fourth, the algorithm utilizes vertex attributes of feature volume to recognize feature type. …”
    Get full text
    Get full text
    Article