Search Results - (( developing one method algorithm ) OR ( java application drops algorithm ))

Refine Results
  1. 1

    New Generalized Algorithm for Developing k-Step Higher Derivative Block Methods for Solving Higher Order Ordinary Differential Equations by Adeyeye, Oluwaseun, Omar, Zurni

    Published 2018
    “…This article presents a new generalized algorithm for developing k-step (m+1) derivative block methods for solving mth order ordinary differential equations. …”
    Get full text
    Get full text
    Get full text
    Article
  2. 2

    Overview of metaheuristic: classification of population and trajectory by Zainul Rashid, Zarina

    Published 2010
    “…An algorithm that applies a metaheuristic method is used when there are no specific methods to find a solution. …”
    Get full text
    Get full text
    Monograph
  3. 3

    MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD by ABDULLAH, H., LAW BOON HUI, C., ZAKARIA, M. S.

    Published 2023
    “…Based on the simulation, the Ant Colony algorithm method is, on average, 10.8% better than conventional methods in reducing machining time. …”
    Get full text
    Get full text
    Article
  4. 4

    MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD by ABDULLAH, H., LAW BOON HUI, C., ZAKARIA, M. S.

    Published 2023
    “…Based on the simulation, the Ant Colony algorithm method is, on average, 10.8% better than conventional methods in reducing machining time. …”
    Get full text
    Get full text
    Article
  5. 5

    MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD by ABDULLAH, H., LAW BOON HUI, C., ZAKARIA, M. S.

    Published 2023
    “…Based on the simulation, the Ant Colony algorithm method is, on average, 10.8% better than conventional methods in reducing machining time. …”
    Get full text
    Get full text
    Article
  6. 6

    MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD by ABDULLAH, H., LAW BOON HUI, C., ZAKARIA, M. S.

    Published 2023
    “…Based on the simulation, the Ant Colony algorithm method is, on average, 10.8% better than conventional methods in reducing machining time. …”
    Get full text
    Get full text
    Article
  7. 7

    Sizing optimization of large-scale grid connected photovoltaic system using dolphin echolocation algorithm / Muhammad Zakyizzuddin Rosselan by Rosselan, Muhammad Zakyizzuddin

    Published 2018
    “…Before incorporating the optimization methods, a sizing algorithm for large-scale GCPV systems was developed. …”
    Get full text
    Get full text
    Thesis
  8. 8
  9. 9

    MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD by H. ABDULLAH, H. ABDULLAH, C. LAW BOON HUI, C. LAW BOON HUI, M. S. ZAKARIA, M. S. ZAKARIA

    Published 2023
    “…Based on the simulation, the Ant Colony algorithm method is, on average, 10.8% better than conventional methods in reducing machining time. …”
    Get full text
    Get full text
    Article
  10. 10

    MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD by H. ABDULLAH, H. ABDULLAH, C. LAW BOON HUI, C. LAW BOON HUI, M. S. ZAKARIA, M. S. ZAKARIA

    Published 2023
    “…Based on the simulation, the Ant Colony algorithm method is, on average, 10.8% better than conventional methods in reducing machining time. …”
    Get full text
    Get full text
    Article
  11. 11

    MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD by ABDULLAH, H., LAW BOON HUI, C., ZAKARIA, M. S.

    Published 2023
    “…Based on the simulation, the Ant Colony algorithm method is, on average, 10.8% better than conventional methods in reducing machining time. …”
    Get full text
    Get full text
    Article
  12. 12

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

    ANALYSIS AND INTERPRETATION OF PRESSURE TRANSIENT TEST DATA BY RECENT ROBUST DECONVOLUTION METHODS by Mohd Mustafa, Muhammad Izzatullah

    Published 2013
    “…Now, most commercial software incorporates either the method developed by von Schroeter et al. or its variants developed by Levitan (2005) and Pimonov et al. (2010). …”
    Get full text
    Get full text
    Final Year Project
  14. 14

    Minimization of machining process sequence based on ant colony algorithm and conventional method by Abdullah, Haslina, Law, Boon Hui C., Zakaria, Mohamad Shukri

    Published 2023
    “…Based on the simulation, the Ant Colony algorithm method is, on average, 10.8% better than conventional methods in reducing machining time. …”
    Get full text
    Get full text
    Get full text
    Article
  15. 15

    Clustering ensemble learning method based on incremental genetic algorithms by Ghaemi, Reza

    Published 2012
    “…In order to address the above mentioned challenges, this study is devoted towards the development of a clusterer and a clustering ensemble learning method based on incremental genetic algorithms addressing group unlabeled samples. …”
    Get full text
    Get full text
    Thesis
  16. 16
  17. 17

    Semiparametric inference procedure for the accelarated failure time model with interval-censored data by Karimi, Mostafa

    Published 2019
    “…The rank-based methods, estimating algorithms, and resampling techniques that are developed do not involve the difficulties of the existing estimating procedures. …”
    Get full text
    Get full text
    Get full text
    Thesis
  18. 18
  19. 19

    Improved algorithms of elliptic curve point multiplication over binary and prime fields using elliptic net by Muslim, Norliana

    Published 2022
    “…In this study, the proposed DBL and DBLADD algorithm using the Karatsuba method for non-supersingular Koblitz curve over m bits binary field with gcd(2m– 1, 3)=1 that incorporates eight blocks of EN with three temporary variables saved two multiplications or 9.09% in DBL and DBLADD algorithms, in comparison to the recent literature pertaining to EN. …”
    Get full text
    Get full text
    Get full text
    Thesis
  20. 20