Search Results - (( based optimization mead algorithm ) OR ( time realization path algorithm ))*

A Novel Polytope Algorithm based on Nelder-mead method for localization in wireless sensor network by Gumaida, Bassam, Abubakar, Adamu

“…Results: Simulation results perfectly showed that the suggested localization algorithm based on NMM can carry out a better performance than that of other localization algorithms utilizing other op- timization approaches, including a particle swarm optimization, ant colony (ACO) and bat algorithm (BA). …”
Get full text
Get full text
Get full text
Get full text

Optimized PID controller of DC-DC buck converter based on archimedes optimization algorithm by Ling, Kuok Fong, Islam, Muhammad Shafiqul, Mohd Ashraf, Ahmad

“…The proposed PID controller, optimized using AOA, is contrasted with PID controllers tuned via alternative algorithms including the hybrid Nelder-Mead method (AEONM), artificial ecosystem-based optimization (AEO), differential evolution (DE), and particle swarm optimizer (PSO). …”
Get full text
Get full text
Get full text

Evaluation of energy-saving potential for optimal time response of HVAC control system in smart buildings by Homod R.Z., Gaeid K.S., Dawood S.M., Hatami A., Sahari K.S.

Nonlinear FXLMS algorithm for active noise control systems with saturation nonlinearity by Sahib, Mouayad A., Raja Ahmad, Raja Mohd Kamil, Marhaban, Mohammad Hamiruce

“…However, NLFXLMS cannot be implemented in real time because the modeling of the SEF cannot be realized. …”
Get full text
Get full text
Get full text

Single and Multiple variables control using Tree Physiology Optimization by Halim, A.H., Ismail, I.

“…The proposed algorithm is also compared with deterministic gradient-free algorithm: Nelder-Mead simplex (NMS) and another metaheuristic algorithm: Particle Swarm Optimization (PSO). …”
Get full text
Get full text

Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization by Mohammad Ata, Karimeh Ibrahim

“…BST inserts the nodes in the way that the Dijkstra’s can find the empty parking in fastest way. Dijkstra’s algorithm initials the paths to finding the shortest path while ACO optimizes the paths. …”
Get full text
Get full text

Optimization algorithms for multipath transfer over asymmetric paths using concurrent multipath transfer stream control transmission protocol by Abass, Abdulridha Hanash

Get full text
Get full text
Get full text

Adaptable decentralized orchestration engine for block structured non-transactional workflow in service oriented architecture. by Esfahani, Faramarz Safi

“…The latter considers the frequent-path adaptability and both of them together satisfy both frequent-path and proportionalfragment adaptability aspects; v) A Fuzzy Decentralization Decision Making algorithm (FDDM) is presented based on the fuzzy logic to choose a suitable method of decentralization that satisfies the three adaptability aspects frequent-path,proportional- fragment and available-bandwidth; and, vi) an algorithm is introduced for wiring of dynamic fragments. …”
Get full text
Get full text

Development of Path Loss Models for Smooth and Convex Surfaces Terrains in Malaysian Environment by Wong, Peng Kiong

“…The UPMPL program provides the utility for calculating the signal characteristics of radio propagation paths and is realized in the run time format version. …”
Get full text
Get full text

Intelligent guidance parking system using modified Dijkstra's algorithm by Jaafar, Haslina, Zabidi, Muhamad Hidayat, Che Soh, Azura, Thong, Peng Hoong, Shafie, Suhaidi, Ahmad, Siti Anom

“…The best parking system is the system that provides customers the ease of finding the available spaces, user friendly and less time consuming. This paper presents the intelligent parking system which apply Dijkstra’s algorithm in finding the shortest path. …”
Get full text
Get full text
Get full text

Surface defect detection and polishing parameter optimization using image processing for G3141 cold rolled steel by Zamri, Ruzaidi

“…This techniques will enables the polishing to be done at specific scratch defect area without necessary to develop polishing path throughout the whole surface which is time consuming. …”
Get full text
Get full text