Search Results - (( simulation estimation path algorithm ) OR ( using optimization parallel algorithm ))

Refine Results
  1. 1

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

    Published 2019
    “…In this research, two novel estimation-based metaheuristic optimization algorithms, named as Simulated Kalman Filter (SKF), and single-solution Simulated Kalman Filter (ssSKF) algorithms are introduced for global optimization problems. …”
    Get full text
    Get full text
    Thesis
  2. 2

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

    Published 2004
    “…This means A • algorithm only calculates and consider the next node m path that has the lowest value of G and F, plus searching the shortest route by using heuristic estimation in Manhattan method. …”
    Get full text
    Get full text
    Thesis
  3. 3

    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
  4. 4
  5. 5
  6. 6

    Parallel metaheuristic algorithm for route planning using CUDA by Looi, Daniel Jun Jie

    Published 2025
    “…Area of Study: Massively Parallel Computing, Combinatorial Optimization Keywords: Parallel Metaheuristic Algorithm, Travelling Salesman Problem, CUDA, GPU, Genetic Algorithm…”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
  7. 7
  8. 8
  9. 9

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

    Published 2016
    “…Using this method, the need for the knowledge of the degree of nonlinearity in advance can be avoided. The proposed algorithm models the Wiener-Hammerstein linear and nonlinear components in the secondary path and applies the estimated degree of nonlinearity of the nonlinear secondary path in the control algorithm design.In previous works, SEF-NLFXLMS and THF-NLFXLMS algorithms for Hammerstein and Wiener structures were developed where the acoustic path is assumed to be a unit gain. …”
    Get full text
    Get full text
    Thesis
  10. 10

    Development of robust control scheme for wheeled mobile robot in restricted environment by Muhammad Sawal, A Radzak

    Published 2021
    “…A novel algorithm so called laser simulator logic (LSL) has been develo ped to estimate the inertia moment when the environment is noisy and cannot use fuzzy logic algorithm. …”
    Get full text
    Get full text
    Thesis
  11. 11

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

    Published 2020
    “…Any optimization algorithm is suitable for only a specific domain of optimization problems. …”
    Get full text
    Get full text
    Thesis
  12. 12

    Development of the propagation paths and deriving observer of feedforward active noise control system by using state-space formulation by Muhssin, Mazin T., Raja Ahmad, Raja Mohd Kamil, Marhaban, Mohammad Hamiruce, Bafti, Payam Shafiei

    Published 2010
    “…This observer will be used to estimate the states along the propagation path which can not be estimated using LMS algorithm because LMS based on the FIR models. …”
    Get full text
    Get full text
    Get full text
    Article
  13. 13

    Voting algorithms for large scale fault-tolerant systems by Karimi, Abbas

    Published 2011
    “…To solve this problem and gain benefits of this algorithm, we employed parallel algorithm technique and by using optimal number of processors, we could propose optimal algorithms known as Parallel Average Voting and Parallel Weighted Average Voting which both have optimal time complexity and less calculation cost. …”
    Get full text
    Get full text
    Thesis
  14. 14
  15. 15

    Delay-based load-balancing routing (DLBR) algorithm for wireless ad-hoc networks by Habib, I., Badruddin, N., Drieberg, M.

    Published 2015
    “…By combining physical layer capacity with MAC layer estimated congestion value, a new delay-based load-balancing routing (DLBR) algorithm is proposed in this paper. …”
    Get full text
    Get full text
    Conference or Workshop Item
  16. 16

    Delay-based load-balancing routing (DLBR) algorithm for wireless ad-hoc networks by Habib, I., Badruddin, N., Drieberg, M.

    Published 2015
    “…By combining physical layer capacity with MAC layer estimated congestion value, a new delay-based load-balancing routing (DLBR) algorithm is proposed in this paper. …”
    Get full text
    Get full text
    Conference or Workshop Item
  17. 17

    A GPGPU Approach to Accelerate Ant Swarm Optimization Rough Reducts (ASORR) Algorithm by Udayanti, Erika Devi, Choo, Yun Huoy, Draman @ Muda, Azah Kamilah, Nugroho, Fajar Agung

    Published 2012
    “…In order to find a reducts, a such applications of rough set uses a discernibility matrix. Ant Swarm Optimization Rough Reducts (ASORR) algorithm is used in rough reducts calculation for identifying significant attribute set optimally. …”
    Get full text
    Get full text
    Conference or Workshop Item
  18. 18
  19. 19

    An adaptive relay selection scheme for enhancing network stability in VANETs by Al-Kharasani, Ameen Mohammed Abdulkarem, Ahmad Zukarnain, Zuriati, Subramaniam, Shamala, Mohd Hanapi, Zurina

    Published 2020
    “…In this paper, we propose a new improvement to the mechanism of the Optimized Link State Routing Protocol(OLSR) protocol, named Cluster-based Adept Cooperative Algorithm (CACA), where each vehicle estimate a reliable low-overhead path using the cluster-based QoS algorithm. …”
    Get full text
    Get full text
    Get full text
    Article
  20. 20

    Investigation on the dynamic of computation of semi autonomous evolutionary computation for syntactic optimization of a set of programming codes by Mohammad Sigit Arifianto, Tze, Kenneth Kin Teo, Liau, Chung Fan, Liawas Barukang, Zaturrawiah Ali Omar

    Published 2007
    “…They have to be optimized for parallel execution while some parts still do have sequential execution due to data dependencies, which makes the optimization problem two folds, parallel and serial. …”
    Get full text
    Get full text
    Research Report