Search Results - time evaluation ((method algorithm) OR (search algorithm))

Refine Results
  1. 1

    A discrete simulated kalman filter optimizer for combinatorial optimization problems by Suhazri Amrin, Rahmad

    Published 2022
    “…An example of a numerical algorithm is the simulated Kalman filter (SKF). Various method has been introduced as an extension of a numerical algorithm to adapt it to a discrete search space. …”
    Get full text
    Get full text
    Thesis
  2. 2

    New Fast Block Matching Algorithm Using New Hybrid Search Pattern And Strategy To Improve Motion Estimation Process In Video Coding Technique by Hamid, Nurul 'Atiqah

    Published 2016
    “…These 6 algorithms are divided into 3 main methods namely Method A, Method B, and Method C depending on their search patterns and strategies. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  3. 3

    Variable block based motion estimation using hexagon diamond full search algorithm (HDFSA) via block subtraction technique by Hardev Singh, Jitvinder Dev Singh

    Published 2015
    “…To evaluate the performance of the developed algorithm, the average PSNR value, average search point and average elapsed processing time is calculated. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  4. 4

    Improved cuckoo search based neural network learning algorithms for data classification by Abdullah, Abdullah

    Published 2014
    “…This exploration and exploitation method followed in the proposed HACPSO algorithm makes it to converge to global optima with more efficiency than the original Cuckoo Search (CS) algorithm. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  5. 5

    Deterministic Mutation-Based Algorithm for Model Structure Selection in Discrete-Time System Identification by Abd Samad, Md Fahmi

    Published 2011
    “…Evolutionary computation (EC) is known to be an effective search and optimization method and in this paper EC is proposed as a model structure selection algorithm. …”
    Get full text
    Get full text
    Get full text
    Article
  6. 6
  7. 7

    An efficient algorithm to discover large and frequent itemset in high dimensional data by Zulkurnain, Nurul Fariza

    Published 2019
    “…Both algorithms apply a minimum cardinality threshold to limit the search space and a closure computation method that does not require storage of previously discovered itemsets for duplicates checking. …”
    Get full text
    Get full text
    Monograph
  8. 8

    Evaluation of Search Result of Document Search Based GA (DSEGA) by Kamal Norfarid, Kamaruddin

    Published 2004
    “…In practice, genetic algorithms have proven very effective in searching through complex, highly nonlinear, multidimensional search spaces. …”
    Get full text
    Get full text
    Get full text
    Thesis
  9. 9

    Block based motion vector estimation using fuhs16 uhds16 and uhds8 algorithms for video sequence by S. S. S. , Ranjit

    Published 2011
    “…Full search (FS), three step search (TSS), new three step search (NTSS), diamond search (DS) and hexagon based search (HS) are the most well known block-matching algorithm. …”
    Get full text
    Get full text
    Get full text
    Book Chapter
  10. 10

    Simulation of shortest path using a-star algorithm / Nurul Hani Nortaja by Nurul Hani , Nortaja

    Published 2004
    “…Definitely this best first search algorithm saves the searching time and improves performance of shortest path finding.…”
    Get full text
    Get full text
    Thesis
  11. 11

    Comparison of performances of Jaya Algorithm and Cuckoo Search algorithm using benchmark functions by Ahmed, Mashuk, Nasser, Abdullah B., Kamal Z., Zamli, Heripracoyo, Sulistyo

    Published 2022
    “…This paper aims to compare the performance of two metaheuristic algorithms which are Jaya Algorithm (JA) and Cuckoo Search (CS) using some common benchmark functions. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  12. 12

    Inversed Control Parameter in Whale Optimization Algorithm and Grey Wolf Optimizer for Wrapper-Based Feature Selection: A Comparative Study by Li Yu Yab, Li Yu Yab, Wahid, Noorhaniza, A Hamid, Rahayu

    Published 2023
    “…On the contrary, mWOA outperformed the original WOA regarding the two criteria mentioned, even on high-dimensional datasets. Evaluating the execution time of the proposed methods, utilizing different classifiers, and hybridizing proposed methods with other metaheuristic algorithms to solve feature selection problems would be future works worth exploring.…”
    Get full text
    Get full text
    Article
  13. 13

    Inversed Control Parameter in Whale Optimization Algorithm and Grey Wolf Optimizer for Wrapper-Based Feature Selection: A Comparative Study by Li Yu Yab, Li Yu Yab, Wahid, Noorhaniza, A Hamid, Rahayu

    Published 2023
    “…On the contrary, mWOA outperformed the original WOA regarding the two criteria mentioned, even on high-dimensional datasets. Evaluating the execution time of the proposed methods, utilizing different classifiers, and hybridizing proposed methods with other metaheuristic algorithms to solve feature selection problems would be future works worth exploring.…”
    Get full text
    Get full text
    Article
  14. 14

    Dual search maximum power point algorithm based on mathematical analysis under partially-shaded conditions by Hajighorbani, Shahrooz

    Published 2016
    “…In evaluation part, the DSMPP algorithm has been compared with two other methods.According to both simulation and experimental results, by implementing the DSMPP technique, the GMPP can be obtained faster. …”
    Get full text
    Get full text
    Thesis
  15. 15

    Sequential and parallel multiple tabu search algorithm for multiobjective urban transit scheduling problems by Uvaraja, Vikneswary

    Published 2018
    “…This thesis studies multiobjective UTSP consisting of frequency setting, timetabling, simultaneous bus and driver scheduling by applying Multiple Tabu Search (MTS) algorithm. Metaheuristic methods have been widely applied to solve UTSP which is a NP-hard problem. …”
    Get full text
    Get full text
    Thesis
  16. 16
  17. 17

    Simulated Kalman Filter algorithms for solving optimization problems by Nor Hidayati, Abdul Aziz

    Published 2019
    “…In the benchmarking of the SKF and ssSKF algorithms’ performance in solving the 14-hole PCB drill path optimization case study with recent implementations, on average, both algorithms show the ability to converge to the optimal solution at a smaller number of function evaluations compared to the Gravitational Search Algorithm (GSA), Cuckoo Search (CS), and Intelligent Water Drop (IWD), although fall-short to the Taguchi- Genetic Algorithm optimization algorithm.…”
    Get full text
    Get full text
    Thesis
  18. 18

    Harmony search-based robust optimal controller with prior defined structure by Rafieishahemabadi, Ali

    Published 2013
    “…In this approach, a combination of interacting two levels HS optimization algorithm is presented. In the first level, a new method for analytical formulation of integral square error cost function based on controller variables is elaborated for performance evaluation purposes by the proposed optimization algorithm. …”
    Get full text
    Get full text
    Thesis
  19. 19

    Effect of negative campaign strategy of election algorithm in solving optimization problem by Hamza Abubakar, Saratha Sathasivam, Shehab Abdulhabib Alzaeemi

    Published 2020
    “…The Election algorithm gives the best individual of the population by enhancing both minimization and coalition operations while local search gives the best local solutions by testing all neighbouring solutions. …”
    Get full text
    Get full text
    Get full text
    Article
  20. 20

    Improved criteria determination of an automated negative lightning return strokes characterisation using Brute-Force search algorithm by Abdul Haris, Faranadia

    Published 2021
    “…Therefore, this study proposed an automated negative lightning return strokes characterisation using a Brute-Force search algorithm, mainly on seven parameters, i.e. on zero-topeak rise time, 10-to-90% rise time, zero-crossing time, slow front time, slow front amplitude relative to peak, fast transition 10-to-90% rise time, and width dE/dt pulse at half peak value. …”
    Get full text
    Get full text
    Thesis