Search Results - (( using optimization modified algorithm ) OR ( using estimation path algorithm ))

Refine Results
  1. 1
  2. 2

    Simulated Kalman Filter with modified measurement, substitution mutation and hamming distance calculation for solving traveling salesman problem by Suhazri Amrin, Rahmad, Zuwairie, Ibrahim, Zulkifli, Md. Yusof

    Published 2022
    “…Simulated Kalman Filter (SKF) solves optimization problems by finding the estimate of the optimum solution. As a multi-agent algorithm, every agent in the population acts as a Kalman filter by using a standard Kalman filter framework, which includes a simulated measurement process and a best-so-far solution as a reference. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  3. 3
  4. 4

    Design of self-tuning minimum effort active noise control with feedback inclusion architecture by Raja Ahmad, Raja Mohd Kamil, Tokhi, Mohammad Osman

    Published 2009
    “…It was found that the optimal controller designed using this technique which is constrained only by the accuracy of the two models identified using recursive least squares algorithm, yields good cancellation level. …”
    Get full text
    Get full text
    Get full text
    Article
  5. 5

    A Continuous Overlay Path Probing Algorithm For Overlay Networks by Feily, Maryam

    Published 2013
    “…Active measurement techniques performed by overlay nodes can provide bandwidth estimations of an end-to-end overlay path. This thesis describes a new algorithm called “COPPA,” which is an in-band path probing algorithm for measuring the end-to-end available bandwidth of an overlay path accurately and continuously. …”
    Get full text
    Get full text
    Thesis
  6. 6

    Nlfxlms and thf-nlfxlms algorithms for wiener-hammerstein nonlinear active noise control by Srazhidinov, Radik

    Published 2016
    “…However, this assumption may lead to inaccurate secondary path model. In this work, the modelling of acoustic path using FIR filters is incorporated for both algorithms for Wiener-Hammerstein structure. …”
    Get full text
    Get full text
    Thesis
  7. 7

    Optimization of modified Bouc–Wen model for magnetorheological damper using modified cuckoo search algorithm by Rosmazi, Rosli, Zamri, Mohamed

    Published 2021
    “…A comparison was done against particle swarm optimization, genetic algorithm, and sine–cosine algorithm, where the modified cuckoo search algorithm showed the lowest root mean square error and fastest convergence rate among the three algorithms.…”
    Get full text
    Get full text
    Get full text
    Article
  8. 8

    Analysis of Dijkstra’s and A* algorithm to find the shortest path by Alija, Amani Saleh

    Published 2015
    “…There are so many algorithms used to find the shortest path such as Dijkstra, A* algorithm, Genetic algorithm, Floyd algorithm and Ant algorithm. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  9. 9
  10. 10

    Modeling of cardiovascular diseases (CVDs) and development of predictive heart risk score by Mirza Rizwan, Sajid

    Published 2021
    “…The warppartial least square method was utilized to estimate the multi-layer hypothesized path model. This model estimated warped coefficients using the overall linear trend found in linear segments of non-linear relationships. …”
    Get full text
    Get full text
    Thesis
  11. 11

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

    Published 2019
    “…The algorithms are evaluated using 30 benchmark functions of the CEC2014 benchmark suite, and then applied to solve PCB drill path optimization case study. …”
    Get full text
    Get full text
    Thesis
  12. 12
  13. 13
  14. 14
  15. 15

    Optimized clustering with modified K-means algorithm by Alibuhtto, Mohamed Cassim

    Published 2021
    “…Clustering technique is able to find hidden patterns and to extract useful information from huge data. Among the techniques, the k-means algorithm is the most commonly used technique for determining optimal number of clusters (k). …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  16. 16

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

    Published 2004
    “…The steps to calculate a shortest path using A • algorithm is shown by using appropriate examples and related figures. …”
    Get full text
    Get full text
    Thesis
  17. 17

    Optimal power flow based on fuzzy linear programming and modified Jaya algorithms by Alzihaymee, Warid Sayel Warid

    Published 2017
    “…A set of modified and novel optimization algorithms are proposed in this thesis to deal with different single and multi-objective OPF problems. …”
    Get full text
    Get full text
    Thesis
  18. 18
  19. 19

    Nonlinear adaptive algorithm for active noise control with loudspeaker nonlinearity by Dehkordi, Sepehr Ghasemi

    Published 2014
    “…The proposed THF-NLFXLMS algorithm models the Wiener secondary path and applies the estimated degree of nonlinearity of the nonlinear secondary path in the control algorithm design. …”
    Get full text
    Get full text
    Thesis
  20. 20

    Modified archive update mechanism of multi-objective particle swarm optimization in fuzzy classification and clustering by Rashed, Alwatben Batoul

    Published 2022
    “…Moreover, interpretability also recorded better results on testing problems, where most of the number of rules were fewer than 33. A clustering algorithm based on MOPSO-CD with a modified archive update mechanism (MCPSO-CD) was used to estimate the optimal number of clusters. …”
    Get full text
    Get full text
    Thesis