Search Results - (( parallel optimization method algorithm ) OR ( wave optimization path algorithm ))*

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

“…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

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

“…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

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

“…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

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

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

Probabilistic ensemble fuzzy ARTMAP optimization using hierarchical parallel genetic algorithms by Loo, C.K., Liew, W.S., Seera, M., Lim, Einly

“…This was achieved by mitigating convergence in the genetic algorithms by employing a hierarchical parallel architecture. …”
Get full text
Get full text
Get full text

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

“…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

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

“…Genetic Algorithm as one of the Evolutionary Computation method improve the execution of parallel programming codes by optimizing the number of processors and the distribution of data. …”
Get full text
Get full text

Improved black-winged kite algorithm and finite element analysis for robot parallel gripper design by Haohao, Ma, As’arry, Azizan, Yanwei, Feng, Lulu, Cheng, Delgoshaei, Aidin, Ismail, Mohd Idris Shah, Ramli, Hafiz Rashidi

“…This paper presents a comprehensive study on the design optimization of a robotic gripper, focusing on both the gripper modeling and the optimization of its parallel mechanism structure. …”
Get full text
Get full text
Get full text

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

“…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

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

“…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

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

“…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

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

“…Examples of EC such as Genetic Algorithm (GA) and PSO (Particle Swarm Optimization) are prevalent due to their efficiency and effectiveness. …”
Get full text
Get full text

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

“…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

Distributed parallel deep learning with a hybrid backpropagation-particle swarm optimization for community detection in large complex networks by Shing, Chiang Ta, Mohammed Al-Andoli, Mohammed Nasser, Wooi, Ping Cheah

“…Next, the method is integrated with two optimization algorithms: (1) backpropagation (BP), which optimizes deep learning locally within each local chunk of the CN; (2) particle swarm optimization (PSO), which is used to improve the BP optimization involving all CN chunks. …”
Get full text
Get full text
Get full text
Get full text

PID Parameters Improvement for AGC in Three Parallel-Connected Power Systems by Mushtaq, Najeeb, Ramdan, Razali, K. G., Mohammed, Hamdan, Daniyal, Ali, M. Humada

“…The AGC loop is used to minimize the frequency deviation and control the power exchange in order to maintain them at their scheduled values due to the changes of the step-load disturbance. The optimal parameters of the PID scheme optimized by the proposed MS algorithm are compared with that one’s obtained by GA algorithm, and the proposed method has proven that its performance is more efficient and improved as well. …”
Get full text
Get full text
Get full text

Design and analysis of high performance matrix filling for DNA sequence alignment accelerator using asic design flow: article / Nurzaima Mahmod by Mahmod, Nurzaima

“…The scope of this paper is to optimize the DNA sequences alignment on the matrix rilling module by implementing a parallel method of the Smith-Waterman algorithm. …”
Get full text
Get full text

Design and analysis of high performance matrix filling for DNA sequence alignment accelerator using ASIC design flow / Nurzaima Mahmod by Mahmod, Nurzaima

“…The scope of this paper is to optimize the DNA sequences alignment on the matrix filling module by implementing a parallel method of the SmithWaterman algorithm. …”
Get full text
Get full text

Application Of Genetic Algorithms For Robust Parameter Optimization by Belavendram, N.

“…Genetic algorithms (GA) are fairly recent in this respect but afford a novel method of parameter optimization. …”
Get full text
Get full text

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

“…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

ROA-CONS: raccoon optimization job scheduling by Koohi, Sina Zangbari, Abdul Hamid, Nor Asilah Wati, Othman, Mohamed, Ibragimov, Gafurjan

Get full text
Get full text