Search Results - (( _ location modified algorithm ) OR ( based application ((amh algorithm) OR (path algorithm)) ))*
Search alternatives:
- location modified »
- based application »
- path algorithm »
- amh algorithm »
-
1
A Modified Route Discovery Approach For Dynamic Source Routing (DSR) Protocol In Mobile Ad-Hoc Networks
Published 2017“…The DSR (Dynamic Source Routing) routing protocol algorithm is one of these routing protocols which consist of two main stages; route discovery and maintenance, where the route discovery algorithm operates based on blind flooding of request messages. blind flooding is considered as the most well known broadcasting mechanism , it is inefficient in terms of communication and resource utilization, which causing increasing the probability of collisions, repeating send several copies of the same message, as well as increasing the delay. …”
Get full text
Get full text
Get full text
Article -
2
An Efficient Route Selection Based on AODV Algorithm for VANET
Published 2016“…The employment of (VANET) assists to increase the data delivery by providing a second path to send an emergency message to the rescue services center (RSC) whenever an accident located at out of coverage area for GSM network. Simulation result shown that VANET modified algorithm based on average signal strength has the advantage of choosing the optimum route to deliver data and own enhanced ratio (17%) by comparing with a maximum signal strength route.…”
Get full text
Get full text
Get full text
Conference or Workshop Item -
3
An Efficient Route Selection based on AODV Algorithm for VANET
Published 2016“…The employment of (VANET) assists to increase the data delivery by providing a second path to send an emergency message to The Rescue Services Center (RSC) whenever an accident located at out of coverage area of GSM network. Simulation tested two of distance ranges among nodes (Long & Short) and the result shown that VANET modified algorithm based on average signal strength has the advantage of choosing the optimum route to deliver data and own enhanced ratio according to the distances (17.5% & 24.1%) by comparing with a maximum signal strength route.…”
Get full text
Get full text
Get full text
Article -
4
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 -
5
IMPLEMENTATION OF GRAPH BASED PATH PLANNING ALGORITHMS FOR INDOOR NAVIGATION
Published 2018“…In this study, we are looking at the performance of four graph-based path planning algorithms which is Breadth First Search, Depth First Search, Dijkstra and A*, when implemented in real world applications. …”
Get full text
Get full text
Final Year Project -
6
Path planning for unmanned aerial vehicles using visibility line-based methods
Published 2011“…Simulation results have proven that the proposed 2D path planning algorithms are much faster in comparison with the VG and hence are suitable for real time path planning applications. …”
Get full text
Get full text
Thesis -
7
-
8
Modelling of multi-robot system for search and rescue
Published 2023Get full text
Get full text
Final Year Project / Dissertation / Thesis -
9
Mobile robot path planning using hybrid genetic algorithm and traversability vectors method
Published 2004“…Recent advances in robotics and machine intelligence have led to the application of modern optimization method such as the genetic algorithm (GA), to solve the path-planning problem. …”
Get full text
Get full text
Get full text
Article -
10
-
11
Modified damage location indices in beam-like structure: Analytical study
Published 2011“…The modified algorithms are able to detect the damage wherever its location, applying even to cases of multi damage locations. …”
Get full text
Get full text
Article -
12
Weighted Sum-Dijkstra’s Algorithm in Best Path Identification based on Multiple Criteria
Published 2018“…Dijkstra’s Algorithm is a shortest path algorithm that considers a single criterion only. …”
Get full text
Get full text
Get full text
Article -
13
-
14
Railway shortest path planner application using ant colony optimization algorithm / Muhammad Hassan Firdaus Ruslan
Published 2017“…For the process module, Ant Colony Optimization (ACO) algorithm was used to find the shortest path. Using ACO, a Railway Shortest Path Planner (RSPP) application will be developed to help user determine their shortest path from one station to another. …”
Get full text
Get full text
Thesis -
15
-
16
-
17
Optimization of mobile robot path planning in semi-dynamic environment using genetic algorithm
Published 2023“…Thus, this thesis aims to develop a mobile robot for industrial applications by leveraging a genetic algorithm (GA). …”
Get full text
Get full text
Get full text
Get full text
Thesis -
18
AUTOMATIC ROUTE FINDER FOR NEW VISITORS
Published 2006“…This project proposes a new visitor route model that is based on shortest path algorithms for road networks. …”
Get full text
Get full text
Final Year Project -
19
Nlfxlms and thf-nlfxlms algorithms for wiener-hammerstein nonlinear active noise control
Published 2016“…However, this assumption may lead to inaccurate secondary path model. In this work, the modelling of acoustic path using FIR filters is incorporated for both algorithms for Wiener-Hammerstein structure. …”
Get full text
Get full text
Thesis -
20
MULTIPLE DRONES PATH OPTIMIZATION ALGORITHM FOR 3D SPACE PERFORMANCE USING CENTRALIZED VISUALIZATION PLATFORM
Published 2019“…The existing methods aim for planning optimal path of drone flight. In this report, a variant of A*, Theta* algorithm is proposed to find the optimal path within a grid-based environment. …”
Get full text
Get full text
Get full text
Final Year Project Report / IMRAD