Search Results - (( time evaluation path algorithm ) OR ( parallel equalization based algorithm ))

The division free parallel algorithm for finding determinant by Karim, Sharmila, Omar, Zurni, Ibrahim, Haslinda

“…A cross multiplication method for determinant was generalized for any size of square matrices using a new permutation strategy.The permutation is generated based on starter sets.However, via permutation, the time execution of sequential algorithm became longer.Thus, in order to reduce the computation time, a parallel strategy was developed which is suited for master and slave paradigm of the high performance computer.A parallel algorithm is integrated with message passing interface.The numerical results showed that the parallel methods computed the determinants faster than the sequential counterparts particularly when the tasks were equally allocated.…”
Get full text
Get full text
Get full text

Multi-robot path planning based on the improved nutcracker optimization algorithm and the dynamic window approach by Zhao, Jiangrong, Ding, Hongwei, Zhu, Yuanjing, Yang, Zhijun, Hu, Peng, Wang, Zongshan

“…Additionally, a simplified path node strategy is also designed to shorten paths and reduce steering times. …”
Get full text
Get full text
Get full text

Performance analysis of genetic algorithm (GA)-based multi-constrained path routing algorithm by Yussof S.

“…The performance of the algorithm is then compared with an exact algorithm called the depth first search and a common shortest path algorithm called the Dijkstra's algorithm. …”

Optimal QoS aware multiple paths web service composition using heuristic algorithms and data mining techniques by Qtaish, Osama Kayed Taher

“…However, when compositions contain more than one execution path (i.e., multiple path's compositions), it is difficult to generate a composite service that simultaneously optimizes all the execution paths involved in the composite service at the same time while meeting the QoS requirements. …”
Get full text
Get full text
Get full text
Get full text

Shortest Path Trajectory System Based on Dijkstra Algorithm by Putri, Indah Pratiwi

“…This project aims to determine locations of the node that reflect all the items in the list, build the route by connecting nodes and evaluate the proposed algorithm for the single source shortest path problem. …”
Get full text
Get full text
Get full text
Get full text

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

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

A hybrid sampling-based path planning algorithm for mobile robot navigation in unknown environments by Khaksar, Weria

“…Sampling-based motion planning is a class of randomized path planning algorithms with proven completeness. …”
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

“…MEMPHA, a hypergraphs-based model, aims to aspire to the challenge by providing topology modelling of the target parallel machine and application modelling of the parallel application, which is hypergraph-based model, to abstract the details of HPAs. …”
Get full text
Get full text

Performance comparison between genetic algorithm and ant colony optimization algorithm for mobile robot path planning in global static environment / Nohaidda Sariff by Sariff, Nohaidda

“…The problem is to find the global path that satisfies the optimization criteria, which are shorter path length and less computation time. …”
Get full text
Get full text

Performance comparison of a and Dijkstra algorithms with bézier curve in 2D grid and OpenStreetMap scenarios by Yusuf, Zakariah, Mohamad, Sufian, Wan Ibrahim, Wan Suhaifiza

“…The evaluation focused on three key performance metrics: computational efficiency, path smoothness, and the number of turns. …”
Get full text
Get full text
Get full text

Real-Time Optimal Trajectory Correction (ROTC) for autonomous quadrotor / Noorfadzli Abdul Razak by Abdul Razak, Noorfadzli

“…However, existing algorithm seems too complicated to be applied. Since there is no technique can enable the quadrotor to implement precision navigation application, the research proposed a Real-Time Optimal Trajectory Correction (ROTC) algorithm. …”
Get full text
Get full text

New Sequential and Parallel Division Free Methods for Determinant of Matrices by Sharmila, Karim

“…Numerical results showed that the parallel methods were able to compute determinants faster than the sequential counterparts, particularly when the tasks were equally allocated. …”
Get full text
Get full text
Get full text

Mitigation of atmospheric turbulences using mode division multiplexing based on decision feedback equalizer for free space optics by Almogahed, Abdullah, Amphawan, Angela, Fazea, Yousef

Get full text
Get full text
Get full text

Optimisation of Environmental Risk Assessment Architecture using Artificial Intelligence Techniques by Salem S. M. Khalifa

“…By contrast, the running time of the safe path selection model (96 µs) is shorter than the running times of Dijkstra's algorithm and the Floyd- Warshall algorithm (150 µs and 184 µs, respectively). …”

Test case generation from state machine with OCL constraints using search-based techniques / Aneesa Ali Ali Saeed by Aneesa Ali, Ali Saeed

“…For test data generation, the existing search-based techniques (SBTs) have been applied to satisfy only one OCL constraint by time. In order to generate optimal data to satisfy whole constraints in the feasible path, new method with SBTs is necessary to satisfy the whole constraints at the same time of the whole path executing. …”
Get full text
Get full text
Get full text

Parallel Diagonally Implicit Runge-Kutta Methods For Solving Ordinary Differential Equations by Din, Ummul Khair Salma

“…All algorithms are written in C language and the parallel code is implemented on Sun Fire V1280 distributed memory system. …”
Get full text
Get full text

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

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

Optimization Of Two-Dimensional Dual Beam Scanning System Using Genetic Algorithms by Koh, Johnny Siaw Paw

“…This thesis presents a new approach to optimize the performance of a dual beam optical scanning system in terms of its scanning combinations and speed, using Genetic Algorithm (GA). The problem has been decomposed into two sub problems; task segregation, where the scanning tasks need to be segregated and assigned for each scanner head, and path planning where the best combinatorial paths for each scanner are determined in order to minimize the total motion of scanning time. …”
Get full text
Get full text

A comparative study on ant-colony algorithm and genetic algorithm for mobile robot planning. by Rajendran, Piraviendran, Othman, Muhaini

“…For case study 2, the ACO algorithm achieved a best distance of 1071 (u) with execution time 1.91 (s), while the GA algorithm resulted in a best distance of 1082 (u) with execution time 0.08 (s). …”
Get full text
Get full text
Get full text

Attack path selection optimization with adaptive genetic algorithms by Abd Rahman, A.S., Zakaria, M.N., Masrom, S.

“…We have incorporated a fuzzy logic controller (FLC) to fine tune the optimization algorithm in run time. The FLC takes into consideration both the exploration and exploitation aspect of the GA. …”
Get full text
Get full text