Search Results - (( initial solution step algorithm ) OR ( java application based algorithm ))

Refine Results
  1. 1

    Solving ump examination timetabling problem using dynamic exploration step counting hill climbing algorithm by Chang, Ling Shing

    Published 2022
    “…Then, the initial solution is improved using our enhanced algorithm called dynamic exploration step counting hill climbing (DESCHC). …”
    Get full text
    Get full text
    Thesis
  2. 2

    Kinetic Parameter Estimation in Alkylation of Benzene with 1-Decene through Hybrid Particle Swarm Optimization by Mohd Zulkefle, Nurul Farihah

    Published 2012
    “…Afterwards, the solution obtained using PSO algorithm is given as initial guesses to the Levenberg–Marquardt algorithm to determine the improved optimal solution. …”
    Get full text
    Get full text
    Final Year Project
  3. 3
  4. 4

    Comparison between Newton’s Method and a new Scaling Newton Method / Ramizah Baharuddin by Baharuddin, Ramizah

    Published 2021
    “…This initial value is often called the “initial guess”. …”
    Get full text
    Get full text
    Thesis
  5. 5

    Automatic selection of initial points for exploratory vessel tracing in fluoroscopic images by Boroujeni, Farsad Zamani, O. K. Rahmat, Rahmita Wirza, Mustapha, Norwati, Affendey, Lilly Suriani, Maskon, Oteh

    Published 2011
    “…The first step of most automatic exploratory tracing algorithms is collecting a number of candidate initial seed points and their initial tracing directions. …”
    Get full text
    Get full text
    Get full text
    Article
  6. 6

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

    An accurate block solver for stiff initial value problems by Musa, H., Suleiman, Mohamed, Ismail, Fudziah, Senu, Norazak, Ibrahim, Zarina Bibi

    Published 2013
    “…New implicit block formulae that compute solution of stiff initial value problems at two points simultaneously are derived and implemented in a variable step size mode. …”
    Get full text
    Get full text
    Get full text
    Article
  8. 8

    Solving computational algorithm using CLONALNet technique based on artificial clonal selection by Samy J.A.L.A., Krishnan P.S.A.L., Kiong T.S.

    Published 2023
    “…CLONALNet enforces an algorithm that is much more robust in evaluating the fitness for each antibody cells since it initiates boundaries so that the initialization process doesn't run off as of previous CLONALG algorithm but still maintains the immune network interaction as in aiNet. …”
    Conference paper
  9. 9

    An improved bat algorithm with artificial neural networks for classification problems by Rehman Gillani, Syed Muhammad Zubair

    Published 2016
    “…However, Bat suffers from large step lengths that sometimes make it to converge to sub-optimal solution. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  10. 10

    New classes of block backward differentiation formula for solving stiff initial value problems by Musa, Hamisu

    Published 2013
    “…The BDF still remain a foundation for most widely used algorithms. In this thesis, new classes of block methods are developed for the solution of sti® initial value problems. …”
    Get full text
    Get full text
    Thesis
  11. 11

    Constructing population of initial solutions for curriculum – based course timetabling problem by Wahid, Juliana, Mohd Hussin, Naimah

    Published 2012
    “…This paper presents an investigation of a combination of graph coloring heuristics in construction approach in University course timetabling problem (UCTP) to produce a population of initial solutions. The graph coloring heuristics were set as individual, combination of three heuristics. …”
    Get full text
    Get full text
    Conference or Workshop Item
  12. 12

    Direct solutions of N-th order initial value problems in decomposition series by Yahaya F., Hashim I., Ismail E.S., Zulkifle A.K.

    Published 2023
    “…In this paper, a class of linear and non-linear nth-order initial value problems (IVPs) is considered. The solutions of these IVPs are obtained by adapting the modified Adomian decomposition method (MADM) as an algorithm for approximating the solutions of the equations in a sequence of time intervals (i.e. time steps). …”
    Article
  13. 13

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

    Examination timetabling using harmony search algorithm by Zainal Abidin, Muhamad Fauzi

    Published 2015
    “…The HSA consist of five steps, which are initialize the HSA parameters, initialize the Harmony Memory (HM), improvise new solutions, update the HM and achieve the termination criteria. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  16. 16
  17. 17

    Topology-aware hypergraph based approach to optimize scheduling of parallel applications onto distributed parallel architectures by Koohi, Sina Zangbari

    Published 2020
    “…However, the current meta-heuristic algorithms do not ensure an optimum solution within a reasonable time. …”
    Get full text
    Get full text
    Thesis
  18. 18

    Modelling of optimal placement and sizing of battery energy storage system using hybrid whale optimization algorithm and artificial immune system for total system losses reduct... by Wong Ling Ai

    Published 2023
    “…As a result, the simultaneous optimisation approach yielded better solutions than the two-step optimisation approach. …”
    text::Thesis
  19. 19

    Diagonal R-point variable step variable order block method for solving second order ordinary differential equations by Zainuddin, Nooraini

    Published 2016
    “…The detailed algorithms on the selection of step sizes and orders are discussed. …”
    Get full text
    Get full text
    Thesis
  20. 20

    A new variant of black hole algorithm based on multi population and levy flight for clustering problem by Haneen Abdul Wahab, Abdul Raheem

    Published 2020
    “…Black Hole (BH) optimization algorithm has been underlined as a solution for data clustering problems. …”
    Get full text
    Get full text
    Thesis