Search Results - (( initial solving method algorithm ) OR ( java application using algorithm ))

Search alternatives:

Refine Results
  1. 1
    Group formation using genetic algorithm

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

    Published 2009
    “…Due to the increasing of complexity in software projects, group work is becoming more important in order to ensure quality software products can be delivered on time.Thus, in universities, group work is seen as a good preparation for students to industry because by working in group, it can reduce the individual workload,improve the ability to manage a project and enhance the problem solving skills. 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
    Save to List
    Saved in:
  2. 2
    A method for group formation using genetic algorithm

    A method for group formation using genetic algorithm by Che Ani, Zhamri, Yasin, Azman, Husin, Mohd Zabidin, Abdul Hamid, Zauridah

    Published 2010
    “…Due to the increasing of complexity in software projects, group work is becoming more important in order to ensure quality software products can be delivered on time.Thus, in universities, group work is seen as a good preparation for students to enter industry because by working in group, it can reduce the individual workload, improve the ability to manage a project and enhance the problem solving skills. However, due to lack of programming skills especially in Java programming language, 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 programming.This paper presents a method for group formation using genetic algorithm, where the members for each group will be generated based on the students’ programming skill.…”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  3. 3
    Shooting method with root finding to solve boundary value problems / Aryani Rima Matakim

    Shooting method with root finding to solve boundary value problems / Aryani Rima Matakim by Matakim, Aryani Rima

    Published 2025
    “…In this study, the result of the shooting method combined with various root-finding algorithms such as the Bisection method, Secant method, Newton's method, Ridder's method, Halley’s method, Brent’s method, Modified Newton method and Improved Ostrowski’s method to solve BVPs is evaluated. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  4. 4
    Multistage optimal homotopy asymptotic method for solving initial-value problems

    Multistage optimal homotopy asymptotic method for solving initial-value problems by Anakira, N. R., Alomari, A. K., Jameela, Ali, Hashim, Ishak

    Published 2016
    “…In this paper, a new approximate analytical algorithm namely multistage optimal homotopy asymptotic method (MOHAM) is presented for the first time to obtain approximate analytical solutions for linear, nonlinear and system of initial value problems (IVPs).This algorithm depends on the standard optimal homotopy asymptotic method (OHAM), in which it is treated as an algorithm in a sequence of subinterval. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  5. 5
    A firefly algorithm based hybrid method for structural topology optimization

    A firefly algorithm based hybrid method for structural topology optimization by Gebremedhen, H.S., Woldemichael, D.E., Hashim, F.M.

    Published 2020
    “…In this paper, a firefly algorithm based hybrid algorithm through retaining global convergence of firefly algorithm and ability to generate connected topologies of optimality criteria (OC) method is proposed as an alternative method to solve stress-based topology optimization problems. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  6. 6
    New uniform order eigh hybrid third derivative block method for solving second order initial value problems

    New uniform order eigh hybrid third derivative block method for solving second order initial value problems by Adeyeye, Oluwaseun, Omar, Zurni

    Published 2016
    “…Hence, not only this article presents a new block method that can be adopted when solving real life problems modelled as second order IVPs, it also gives a more convenient algorithm for developing hybrid block methods.…”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  7. 7
    Hybrid tabu search – strawberry algorithm for multidimensional knapsack problem

    Hybrid tabu search – strawberry algorithm for multidimensional knapsack problem by Wong, Jerng Foong

    Published 2022
    “…In 2011, a new metaheuristic known as Strawberry algorithm (SBA) was initiated. Since then, it has been vastly applied to solve engineering problems. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  8. 8
    RSA Encryption & Decryption using JAVA

    RSA Encryption & Decryption using JAVA by Ramli, Marliyana

    Published 2006
    “…References and theories to support the research of 'RSA Encryption/Decryption using Java' have been disclosed in Literature Review section. …”
    Get full text
    Get full text
    Final Year Project
    Save to List
    Saved in:
  9. 9
    Comparative Analysis of Low Discrepancy Sequence-Based Initialization Approaches Using Population-Based Algorithms for Solving the Global Optimization Problems

    Comparative Analysis of Low Discrepancy Sequence-Based Initialization Approaches Using Population-Based Algorithms for Solving the Global Optimization Problems by Waqas Haider Bangyal, Kashif Nisar, Ag. Asri Bin Ag. Ibrahim, Muhammad Reazul Haque, Joel J. P. C. Rodrigues, Danda B. Rawat

    Published 2021
    “…Metaheuristic algorithms have been widely used to solve diverse kinds of optimization problems. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  10. 10
    A variant fisher and Jaikuamr algorithm to solve capacitated vehicle routing problem

    A variant fisher and Jaikuamr algorithm to solve capacitated vehicle routing problem by Sultana, Tanzima, Akhand, Md Aminul Haque, Rahman, M.M. Hafizur

    Published 2017
    “…The initial clusters formation in a method are subjected to route optimization. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Proceeding Paper
    Save to List
    Saved in:
  11. 11
    Plagiarism Detection System for Java Programming Assignments by Using Greedy String-Tilling Algorithm

    Plagiarism Detection System for Java Programming Assignments by Using Greedy String-Tilling Algorithm by Norulazmi, Kasim

    Published 2008
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  12. 12
    Provider independent cryptographic tools

    Provider independent cryptographic tools by Ibrahim, Subariah, Salleh, Mazleena, Abdul Aziz, Shah Rizan

    Published 2003
    Get full text
    Get full text
    Get full text
    Monograph
    Save to List
    Saved in:
  13. 13
    Enhanced Harris's Hawk algorithm for continuous multi-objective optimization problems

    Enhanced Harris's Hawk algorithm for continuous multi-objective optimization problems by Yasear, Shaymah Akram

    Published 2020
    “…A two-step enhanced non-dominated sorting HHMO (2SENDSHHMO) algorithm has been proposed to solve this problem. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  14. 14
    Modified Sumudu Transform Analytical Approximate Methods For Solving Boundary Value Problems

    Modified Sumudu Transform Analytical Approximate Methods For Solving Boundary Value Problems by Al-Nemrat, Asem Mustafa Moh’ad

    Published 2019
    “…In addition, for the STVIM method, a new algorithm has been proposed to solve various kinds of linear and nonlinear second-order two-point BVPs. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  15. 15
    Modified Sumudu Transform Analytical Approximate Methods For Solving Boundary Value Problems

    Modified Sumudu Transform Analytical Approximate Methods For Solving Boundary Value Problems by Al-Nemrat, Asem Mustafa Moh’ad

    Published 2019
    “…In addition, for the STVIM method, a new algorithm has been proposed to solve various kinds of linear and nonlinear second-order two-point BVPs. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  16. 16
    Parallel execution of diagonally implicit Runge-Kutta methods for solving IVPs.

    Parallel execution of diagonally implicit Runge-Kutta methods for solving IVPs. by Ismail, Fudziah, Siri, Zailan, Othman, Mohamad, Suleiman, Mohamed

    Published 2009
    “…In this paper we used DIRK methods which are specifically designed for parallel execution to solve a set of initial value problems. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  17. 17
    Solving Zhou's chaotic system using Euler's method

    Solving Zhou's chaotic system using Euler's method by Mohd Roslan, Umuu ’Atiqah, Salleh, Zabidin, Kilicman, Adem

    Published 2010
    “…An algorithm for Euler’s method is used to obtain an approximation for the initial-value problem for ordinary differential equation. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  18. 18
    An Integrated RRT*SMART-A* Algorithm for solving the Global Path Planning Problem in a Static Environment

    An Integrated RRT*SMART-A* Algorithm for solving the Global Path Planning Problem in a Static Environment by Suwoyo, Heru, Adriansyah, Andi, Andika, Julpri, Ubaidillah, Abu

    Published 2023
    “…Thus, RRT*-Smart, a further development of RRT*, is considered ideal for solving RRT* problems. Unlike RRT*, RRT*-Smart applies a path optimization by removing the redundant nodes from the initial path when it is gained. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  19. 19
    AN INTEGRATED RRT*SMART-A* ALGORITHM FOR SOLVING THE GLOBAL PATH PLANNING PROBLEM IN A STATIC ENVIRONMENT

    AN INTEGRATED RRT*SMART-A* ALGORITHM FOR SOLVING THE GLOBAL PATH PLANNING PROBLEM IN A STATIC ENVIRONMENT by SUWOYO, HERU, ADRIANSYAH, ANDI, ANDIKA, JULFRI, SHAMSUDIN, ABU UBAIDAH, ZAKARIA, MOHAMAD FAUZI

    Published 2023
    “…Thus, RRT*-Smart, a further development of RRT*, is considered ideal for solving RRT* problems. Unlike RRT*, RRT*-Smart applies a path optimization by removing the redundant nodes from the initial path when it is gained. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  20. 20
    AN INTEGRATED RRT*SMART-A* ALGORITHM FOR SOLVING THE GLOBAL PATH PLANNING PROBLEM IN A STATIC ENVIRONMENT

    AN INTEGRATED RRT*SMART-A* ALGORITHM FOR SOLVING THE GLOBAL PATH PLANNING PROBLEM IN A STATIC ENVIRONMENT by Suwayo, Heri, Adrishah, Andi, Andika, Juleri, Shamdudin, Abu Ubaidah, Zakaria, Mohamad Fauzi

    Published 2023
    “…Thus, RRT*-Smart, a further development of RRT*, is considered ideal for solving RRT* problems. Unlike RRT*, RRT*-Smart applies a path optimization by removing the redundant nodes from the initial path when it is gained. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:

Search Tools: