Search Results - (( development using case algorithm ) OR ( java application customization algorithm ))

Refine Results
  1. 1

    Enhancing obfuscation technique for protecting source code against software reverse engineering by Mahfoudh, Asma

    Published 2019
    “…The proposed technique can be enhanced in the future to protect games applications and mobile applications that are developed by java; it can improve the software development industry. …”
    Get full text
    Get full text
    Thesis
  2. 2

    The Development Of A Robust Algorithm For Uav Path Planning In 3d Environment by Kok, Kai Yit

    Published 2016
    “…Nine terrain maps were used as case studies, and 100 simulations were carried out for each case to determine the average performance of the proposed algorithm. …”
    Get full text
    Get full text
    Thesis
  3. 3

    An improved algorithm in test case generation from UML activity diagram using activity path by Hashim, Nor Laily, Salman, Yasir D.

    Published 2011
    “…This paper proposed an improved algorithm to automatically generate test cases directly from UML activity diagram using an activity graph.This algorithm has been implemented as a prototype using UML activity diagrams as inputs to generate test cases.These generated test cases are generated automatically are compared to test cases that are generated manually in order to evaluate the algorithm’s usability and reliability.The result shows that the test cases generated by the developed test case generator program are the same as the one manually derived.…”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  4. 4

    An interactive analytics approach for sustainable and resilient case studies: a machine learning perspective by Mousavi, Seyed Mohsen, Sadeghi R., Kiarash, Lee, Lai Soon

    Published 2023
    “…To show the methods applicability, this paper uses the proposed algorithm in three sustainable and resilient case studies. …”
    Get full text
    Get full text
    Article
  5. 5

    Thalassaemia detection using CBR Algorithm via mobile device by Nur Faezah, Omar

    Published 2011
    “…CBR Algorithm is an algorithm that can solve a new problem by remembering a previous similar situation and by reusing information and knowledge of that situation in a new situation.CBR is suit for solving the problem in Thalassaemia cases.The model is designed and prototype is developed to test the diagnosis accuracy of the model.T his application is focus on Beta Thalassaemia and Haemoglobin E Trait only.For platform, this application will be using the mobile device such as PDA. …”
    Get full text
    Get full text
    Undergraduates Project Papers
  6. 6

    Thalassaemia detection using CBR Algorithm via mobile device by Nur Faezah, Omar

    Published 2011
    “…CBR Algorithm is an algorithm that can solve a new problem by remembering a previous similar situation and by reusing information and knowledge of that situation in a new situation.CBR is suit for solving the problem in Thalassaemia cases.The model is designed and prototype is developed to test the diagnosis accuracy of the model.T his application is focus on Beta Thalassaemia and Haemoglobin E Trait only.For platform, this application will be using the mobile device such as PDA. …”
    Get full text
    Get full text
    Undergraduates Project Papers
  7. 7

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

    Published 2018
    “…The algorithms are used to generate test cases for nine different Boolean expressions of different size and complexities. …”
    Get full text
    Get full text
    Thesis
  8. 8

    PSAT : a pairwise test data generation tool based on simulated annealing algorithm by Goh, Ghee Hau

    Published 2015
    “…In this research, the test case will be generated based on the SA algorithm to show that the test case can be generated with sufficient.…”
    Get full text
    Get full text
    Undergraduates Project Papers
  9. 9

    Minimization of Test Cases and Fault Detection Effectiveness Improvement through Modified Reduction with Selective Redundancy Algorithm by Nikfal, Shima

    Published 2007
    “…Then the algorithm gathers all the test cases based on the definition occurrence and def-use pair if they cover same definition occurrence of one variable but they don’t cover def-use pair of the same variable. …”
    Get full text
    Get full text
    Thesis
  10. 10

    Optimization of assembly line balancing with energy efficiency by using tiki-taka algorithm by Ariff Nijay, Ramli

    Published 2023
    “…Lastly, a study of the industrial case was performed as a validation of the developed model and algorithm. …”
    Get full text
    Get full text
    Thesis
  11. 11

    Firefly algorithm for optimal sizing of Standalone Photovoltaic System / Nurizzati Abdul Aziz by Abdul Aziz, Nurizzati

    Published 2016
    “…Apart from that, Iterative-based Sizing Algorithms (ISA) for each design case with the two sizing approaches were developed to determine the optimal solutions which were used as benchmark for FASA. …”
    Get full text
    Get full text
    Thesis
  12. 12

    Firefly algorithm for optimal sizing of stand-alone photovoltaic system / Nur Izzati Abdul Aziz by Abdul Aziz, Nur Izzati

    Published 2016
    “…Apart from that, Iterative-based Sizing Algorithms (ISA) for each design case with the two sizing approaches were developed to determine the optimal solutions which were used as benchmark for FASA. …”
    Get full text
    Get full text
    Thesis
  13. 13
  14. 14

    Hybrid Artificial Bees Colony algorithms for optimizing carbon nanotubes characteristics by Mohammad Jarrah, Mu'ath Ibrahim

    Published 2018
    “…Chemical Vapor Deposition (CVD) is the most efficient method for CNTs production.However,using CVD method encounters crucial issues such as customization,time and cost.Therefore,Response Surface Methodology (RSM) is proposed for modeling and the ABC-βHC is proposed for optimization purpose to address such issues.The selected CNTs characteristics are CNTs yield and quality represented by the ratio of the relative intensity of the D and G-bands (ID/IG).Six case studies are generated from collected dataset including four cases of CNTs yield and one case of ID/IG as single objective optimization problems,while the sixth case represents multi-objective problem.The input parameters of each case are a subset from the set of input parameters including reaction temperature,duration,carbon dioxide flow rate,methane partial pressure,catalyst loading,polymer weight and catalyst weight.The models for the first three case studies were mentioned in the original work.RSM is proposed to develop polynomial models for the output responses in the other three cases and to identi significant process parameters and interactions that could affect the CNTs output responses.The developed models are validated using t-test,correlation and pattern matching.The predictive results have a good agreement with the actual experimental data.The models are used as objective functions in optimization techniques.For multi-objective optimization,this study proposes Desirability Function Approach (DFA) to be integrated with other proposed algorithms to form hybrid techniques namely RSM-DFA,ABC-DFA and ABC-βHC-DFA.The proposed algorithms and other selected well-known algorithms are evaluated and compared on their CNTs yield and quality.The optimization results reveal that ABC-βHC and ABC-βHC-DFA obtained significant results in terms of success rate,required time,iterations,and function evaluations number compared to other well-known algorithms.Significantly,the optimization results from this study are better than the results from the original work of the collected dataset.…”
    Get full text
    Get full text
    Get full text
    Thesis
  15. 15
  16. 16

    Fast Finite Difference Time Domain Algorithms for Solving Antenna Application Problem by Hasan, Mohammad Khatim

    Published 2008
    “…Complexity reduction approach concept is used to develop these algorithms. This approach split the solution domain into 1 3 and 2 3 compartments in 1D case and 1 9 and 8 9 compartments in 2D cases. …”
    Get full text
    Get full text
    Thesis
  17. 17
  18. 18
  19. 19

    Solving transcendental equation using genetic algorithm / Masitah Hambari by Masitah , Hambari

    Published 2004
    “…This project studies the potential of using Genetic Algorithm and develops a program in order to solve Transcendental Equation in optimizing problem domain. …”
    Get full text
    Get full text
    Thesis
  20. 20

    Adapting the Elitism on the Greedy Algorithm for Variable Strength Combinatorial Test Cases Generation by Bahomaid, Ameen A., Alsewari, Abdulrahman A., Zamli, Kamal Z., Alsariera, Yazan A.

    Published 2018
    “…This study presented the most recent variable interaction strength (VS) CT strategy using an enhanced variant in the greedy algorithm. …”
    Get full text
    Get full text
    Get full text
    Article