Search Results - (( _ application ((amh algorithm) OR (path algorithm)) ) OR ( its application modified algorithm ))
Search alternatives:
- application modified »
- path algorithm »
- amh algorithm »
-
1
Comparison of path planning in simulated robot
Published 2020“…This is because each path planning algorithm has its own applicable domain, performance, advantages and disadvantages in various situations. …”
Get full text
Get full text
Final Year Project / Dissertation / Thesis -
2
Simulated Kalman Filter with modified measurement, substitution mutation and hamming distance calculation for solving traveling salesman problem
Published 2022“…We reviewed 57 SKF papers. 16 of them on fundamental improvements, 9 on extension of the algorithm to discrete problems and 25 on their applications. …”
Get full text
Get full text
Get full text
Get full text
Conference or Workshop Item -
3
Application of harmonic functions through Modified SOR (MSOR) method for robot path planning in indoor structured environment
Published 2017“…This paper presents the application of harmonic functions computed through MSOR iterative method to solve path planning problem in indoor environment. …”
Get full text
Get full text
Get full text
Get full text
Article -
4
Extensions to the K-AMH algorithm for numerical clustering
Published 2018Get full text
Get full text
Get full text
Article -
5
-
6
Optimization Method Using Modified Harmony Search For Coverage And Energy Efficiency In Wireless Sensor Network
Published 2018“…However,the sink node position and size of data transmitted will not affect the performance of coverage area.This is because the coverage area value is fluctuated as the parameters value increases.Throughout the experiment conducted,sensor nodes deployed using Modified Harmony Search algorithm (MHS) gives better coverage area compared to other existing methods.The average coverage area percentage obtained by Modified Harmony Search is 63 %.The average coverage area percentage obtained by Modified Random is 48 % and the average coverage area percentage obtained by Harmony Search is 46 %.The highest coverage area recorded for Modified Harmony Search is 70 %.To enhance the energy efficiency,shortest path distance finder is added to each method.Throughout the research,Modified Harmony Search with shortest path distance finder gives optimum results.…”
Get full text
Get full text
Get full text
Get full text
Thesis -
7
-
8
Partitional clustering algorithms for highly similar and sparseness y-short tandem repeat data / Ali Seman
Published 2013“…The idea was incorporated into a new algorithm called, k-Approximate Modal Haplotypes (&-AMH) algorithm. …”
Get full text
Get full text
Thesis -
9
NN with DTW-FF Coefficients and Pitch Feature for Speaker Recognition
Published 2006“…The idea behind this method is due to neural network (NN) limitation where a fixed amount of input nodes is needed for every input class especially in the application of multiple inputs. The new feature processing used the modified version of traditional DTW called as DTW-FF algorithm to fix the input size so that the source and template frames have equal number of frames. …”
Get full text
Get full text
Article -
10
An Efficient Route Selection Based on AODV Algorithm for VANET
Published 2016Get full text
Get full text
Get full text
Conference or Workshop Item -
11
An Efficient Route Selection based on AODV Algorithm for VANET
Published 2016Get full text
Get full text
Get full text
Article -
12
Optimization of fast fourier transform based on twiddle factor using genetic algorithm on raspberry pi
Published 2019“…The research work revolves around the 16-point Radix-4 Single Path Delay Feedback (R4SDF) for optimizing the pipelined Fast Fourier Transform (FFT) processor, which can be done by using both Single Objective Genetic Algorithm and Multi-Objective Genetic Algorithm , Nowadays in many areas of engineering and science are widely using FFT processors in most of their applications, thus, the modern science requires continuously new optimizations which includes the FFT processor to have a lower power consumption and a smaller size. …”
Get full text
Get full text
Thesis -
13
-
14
A 'snowflake' geometrical representation for optimised degree six 3-modified chordal ring networks
Published 2016Get full text
Get full text
Conference or Workshop Item -
15
-
16
Adaptive manet OLSR routing protocol for optimal route selection in high dynamic network
Published 2020“…The proposed Quality of Path QoP metric is incorporated into the modified relay selection algorithm, which improves the efficiency of relay selection mechanism to find optimal path with high link quality. …”
Get full text
Get full text
Thesis -
17
Cut-off solar charge controller as an alternative towards system efficiency optimization
Published 2014“…Based on the concept of optimizing the efficiency of the automated solar system in residential buildings application, this paper proposed a High efficiency solar Cut-Off charge controller as an alternative to the main solar charge controller in most conventional buildings solar system, the idea is to design an electronic circuit with low losses as a compared with the conventional charge controller to be a part of the integrated and automated building solar system, the design has an algorithm based on some environment parameters like sun Irradiance and weather temperature, this algorithm seems to be inversely calculated because its start from the value of full charge battery voltage. …”
Get full text
Get full text
Conference or Workshop Item -
18
Digital forensic investigation reduction model (DIFReM) for Windows 10 OS
Published 2018“…An algorithm was used to verify filetypes by looking up a File Signature library to compare files’ header with their extension. …”
Get full text
Get full text
Thesis -
19
IMPLEMENTATION OF GRAPH BASED PATH PLANNING ALGORITHMS FOR INDOOR NAVIGATION
Published 2018“…In which the obstacles, start node and target node will be known in advance of starting the path planning algorithms. Based on the results of MATLAB simulation, the A* algorithm is the best algorithm in finding the shortest path with the least time taken. …”
Get full text
Get full text
Final Year Project -
20
