Search Results - (( wave optimization path algorithm ) OR ( parallel evaluation case algorithm ))

Refine Results
  1. 1

    A generalized laser simulator algorithm for optimal path planning in constraints environment by Aisha, Muhammad

    Published 2022
    “…The results demonstrated that the proposed method could generate an optimal collision-free path. Moreover, the proposed algorithm result are compared to some common algorithms such as the A* algorithm, Probabilistic Road Map, RRT, Bi-directional RRT, and Laser Simulator algorithm to demonstrate its effectiveness. …”
    Get full text
    Thesis
  2. 2

    A generalized laser simulator algorithm for mobile robot path planning with obstacle avoidance by Muhammad, Aisha, Ali, Mohammed A.H., Turaev, Sherzod, Abdulghafor, Rawad Abdulkhaleq Abdulmolla, Shanono, Ibrahim Haruna, Alzaid, Zaid, Alruban, Abdulrahman, Alabdan, Rana, Dutta, Ashit Kumar, Almotairi, Sultan

    Published 2022
    “…An optimal path between the start and target point is found by forming a wave of points in all directions towards the target position considering target minimum and border maximum distance principles. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  3. 3

    Parallel Execution of Runge-Kutta Methods for Solving Ordinary Differential Equations by Siri, Zailan

    Published 2004
    “…All the numerical results are given to illustrate the algorithms developed for the cases that we were tested. …”
    Get full text
    Get full text
    Thesis
  4. 4

    Novel algorithm for mobile robot path planning in constrained environment by Muhammad, Aisha, Ali, Mohammed A. H., Turaev, Sherzod, Shanono, Ibrahim Haruna, Hujainah, Fadhl, Mohd Zubir, Mohd Nashrul, Faiz, Muhammad Khairi, Mohd Faizal, Erma Rahayu, Abdulghafor, Rawad Abdulkhaleq Abdulmolla

    Published 2021
    “…The results demonstrated that the proposed method is able to generate efficiently an optimal collision-free path. Moreover, the performance of the proposed method was compared with the A-star and laser simulator (LS) algorithms in terms of path length, computational time and path smoothness. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  5. 5

    Novel algorithm for mobile robot path planning in constrained environment by Aisha, Muhammad, Ali, Mohammed A. H., Turaev, Sherzod, Shanono, Ibrahim Haruna, Hujainah, Fadhl, Mohd Nashrul, Mohd Zubir, Muhammad Khairi Faiz, ., Erma Rahayu, Mohd Faizal, Abdulghafor, Rawad

    Published 2022
    “…The results demonstrated that the proposed method is able to generate efficiently an optimal collision-free path. Moreover, the performance of the proposed method was compared with the A-star and laser simulator (LS) algorithms in terms of path length, computational time and path smoothness. …”
    Get full text
    Get full text
    Get full text
    Article
  6. 6

    Novel algorithm for mobile robot path planning in constrained environment by Muhammad, Aisha, Ali, Mohammed A. H., Turaev, Sherzod, Shanono, Ibrahim Haruna, Hujainah, Fadhl, Mohd Nashrul, Mohd Zubir, Muhammad Khairi, Faiz, Erma Rahayu, Mohd Faizal, Abdulghafor, Rawad

    Published 2022
    “…The results demonstrated that the proposed method is able to generate efficiently an optimal collision-free path. Moreover, the performance of the proposed method was compared with the A-star and laser simulator (LS) algorithms in terms of path length, computational time and path smoothness. …”
    Get full text
    Get full text
    Get full text
    Article
  7. 7

    Analysis of evolutionary computing performance via mapreduce parallel processing architecture / Ahmad Firdaus Ahmad Fadzil by Ahmad, Ahmad Firdaus

    Published 2014
    “…MR is an emerging parallel processing framework that hides the complex parallelization processes by employing the functional abstraction of "map and reduce" The Performance of the parallelized GA via MR and PSO via MR are evaluated using an analogous case study to find out the speedup and efficiency in order to measure the scalability of both proposed algorithms. …”
    Get full text
    Get full text
    Thesis
  8. 8

    Development of a State-Space Observer for Active Noise Control Systems by Muhssin, Mazin T.

    Published 2009
    “…The secondary path of the ANC system is modeled by using the LMS algorithm to complete the design of the Filtered-X Least Mean Square (FXLMS) controller. …”
    Get full text
    Get full text
    Thesis
  9. 9

    Workflow optimization in distributed computing environment for stream-based data processing model / Saima Gulzar Ahmad by Saima Gulzar, Ahmad

    Published 2017
    “…Similarly, when data parallelism is introduced in the algorithm the performance of the algorithm improved further by 12% in latency and 17% in throughput when compared to PDWA algorithm. …”
    Get full text
    Get full text
    Get full text
    Thesis
  10. 10

    Levy slime mould algorithm for solving numerical and engineering optimization problems by J. J., Jui, M. A., Ahmad, M. I. M., Rashid

    Published 2022
    “…The proposed Levy Slime Mould Algorithm (LSMA) is a novel metaheuristic algorithm that integrates the Levy distribution into a new metaheuristic called Slime Mould Algorithm (SMA) for solving numerical and engineering problems. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  11. 11

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

    Published 2018
    “…Additionally, the MTS algorithm is also implemented in parallel computing to produce parallel MTS for generating comparable solutions in shorter computational times. …”
    Get full text
    Get full text
    Thesis
  12. 12

    Efficient and scalable ant colony optimization based WSN routing protocol for IoT by Sharmin, Afsah, Anwar, Farhat, Motakabber, S. M. A.

    Published 2020
    “…For this reason, many intelligent systems have been utilized to design routing algorithms to handle the network's dynamic state. In this paper, an ant colony optimization (ACO) based WSN routing algorithm for IoT has been proposed and analyzed to enhance scalability, to accommodate node mobility and to minimize initialization delay for time critical applications in the context of IoT to find the optimal path of data transmission, improvising efficient IoT communications. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  13. 13

    A Community-Based Fault Isolation Approach for Effective Simultaneous Localization of Faults by Zakari, Abubakar, Lee, Sai Peck, Targio Hashem, Ibrahim Abaker

    Published 2019
    “…Multiple faults in a program may reduce the effectiveness of the existing fault localization techniques due to the complex relationship between faults and failures in the presence of multiple faults. In an ideal case, faults are isolated into fault-focused clusters, each targeting a single fault for developers to localize them simultaneously in parallel. …”
    Get full text
    Get full text
    Article
  14. 14
  15. 15

    Efficient relay placement algorithm using landscape aware routing (erpalar) by Onabajo, Olawale Olusegun

    Published 2011
    “…ERP ALAR was implemented in Matlab R2009a using Genetic Algorithm (GA) with multi-objectives. GA is an optimization algorithm that simulates natural selection process as found in nature. …”
    Get full text
    Get full text
    Thesis
  16. 16

    Performance Evaluation Of Combined Code-Space Division Multiple Access With Enhanced Parallel Interference Cancellation by Odeh, Nidhal A.S.

    Published 2007
    “…Finally, the probability of blocking was evaluated in terms of various numbers of available codes. …”
    Get full text
    Get full text
    Thesis
  17. 17

    Online system identification development based on recursive weighted least square neural networks of nonlinear hammerstein and wiener models. by Kwad, Ayad Mahmood

    Published 2022
    “…Best Hammerstein parallel NN polynomial based model and series-parallel NN polynomial model are 88.75% and 93.9% respectively, for best Hammerstein parallel NN sigmoid based model and series-parallel NN sigmoid based model 78.26% and 95.95% respectively, and for best Hammerstein parallel NN hyperbolic tangent based model and series-parallel NN hyperbolic tangent based model 70.7% and 96.4% respectively. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  18. 18

    Dynamic partitioning and data allocation method on heterogeneous architecture / Muhammad Helmi Rosli by Rosli, Muhammad Helmi

    Published 2015
    “…Each experiment highlight the advantages and disadvantages of the experimental architecture.The disadvantages from each experiment prompts the design of dynamic parallel partitioning and allocating framework. The case study use for this experiment is Sobel edge detection algorithm. …”
    Get full text
    Get full text
    Thesis
  19. 19

    A test case generation framework based on UML statechart diagram by Salman, Yasir Dawood

    Published 2018
    “…Unfortunately, existing studies in this domain are not sufficiently comprehensive in describing the major processes of the automated test case generation. Furthermore, the algorithms used for test case generation are not provided or well described. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  20. 20

    Exploring machine learning algorithms for accurate water level forecasting in Muda river, Malaysia by Adli Zakaria M.N., Ahmed A.N., Abdul Malek M., Birima A.H., Hayet Khan M.M., Sherif M., Elshafie A.

    Published 2024
    “…Even though the lowest reported performance was reported by the XGBoost, it is the faster of the three algorithms due to its advanced parallel processing capabilities and distributed computing architecture. …”
    Article