Search Results - (( java application using algorithm ) OR ( dynamic location path algorithm ))
Search alternatives:
- java application »
- dynamic location »
- using algorithm »
- path algorithm »
-
1
New algorithm for autonomous dynamic path planning in real-time intelligent robot car
Published 2017“…Through the use of modified A* algorithm, the optimal path with a minimum cost can be determined and an efficient execution time of moving from a starting location to a target location in a dynamic environment can be achieved. …”
Get full text
Get full text
Get full text
Article -
2
-
3
Modification of dijkstra's algorithm for safest and shortest path during emergency evacuation
Published 2015“…It uses modified Dijkstra's algorithm in order to incorporate both aspects and considering the hazardous location. …”
Get full text
Get full text
Get full text
Article -
4
Visual servo algorithm of robot arm simulation for dynamic tracking and grasping application
Published 2022“…Future works are required to improve the dynamic visual servo algorithm with motion planning when obstacles are present in the path of robot grasping.…”
Get full text
Get full text
Get full text
Article -
5
A Modified Route Discovery Approach For Dynamic Source Routing (DSR) Protocol In Mobile Ad-Hoc Networks
Published 2017“…There are many types of routing protocols that operate within MANET networks, which responsible for finding paths between the source and destination nodes with the modernization of these paths which are constantly changing due to the dynamic topology of the network stemming from the constant random movement of the nodes. …”
Get full text
Get full text
Get full text
Article -
6
Solving vehicle routing problem by using improved K-nearest neighbor algorithm for best solution
Published 2017“…Objectives: Our paper attempt to find an optimal route result for VRP by using K-Nearest Neighbor Algorithm (KNNA). To achieve an optimal solution for VRP with the accompanying targets: (1) To reduce the distance and the time for all paths this leads to speedy the transportation of customers to their locations, (2) To implement the capacitated vehicle routing problem (CVRP) model for optimizing the solutions. …”
Get full text
Get full text
Get full text
Article -
7
Attack graph construction for enhancing intrusion prediction based on vulnerabilities metrics
Published 2023“…This study employs use Random Forest algorithm to identify and forecast attacks to dynamically locate the attack location in the network for attack graph analysis. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
8
A new multicast-based architecture to support host mobility in IPv6
Published 2003“…The mechanism is based on hash algorithm. This paper explains the construction of a dynamic delivery tree of the mobile node movement for a multicast-based mobile IPv6 network, such that the branches of the tree constitute the shortest paths from the packet source to each of the visited locations. …”
Get full text
Get full text
Get full text
Get full text
Proceeding Paper -
9
RSA Encryption & Decryption using JAVA
Published 2006“…References and theories to support the research of 'RSA Encryption/Decryption using Java' have been disclosed in Literature Review section. …”
Get full text
Get full text
Final Year Project -
10
-
11
Provider independent cryptographic tools
Published 2003Get full text
Get full text
Get full text
Monograph -
12
A new multicast-based architecture to support host mobility in IPv6
Published 2003“…The mechanism is based on hash algorithm. This paper explains the construction of a dynamic delivery tree of the mobile node movement for a multicast-based mobile IPv6 network, such that the branches of the tree constitute the shortest paths from the packet source to each of the visited locations. …”
Get full text
Get full text
Conference or Workshop Item -
13
Attack prediction to enhance attack path discovery using improved attack graph
Published 2022“…For the attack graph analysis, the random forest algorithm was used to detect, predict, and dynamically ascertain the attack location in the network. …”
Get full text
Get full text
Get full text
Article -
14
Autonomous Navigation Robot using Slam and Path Planning Based on a Single RP-LIDAR
Published 2025“…The approach was evaluated in a laboratory environment (11 meter by 8 meter) and successfully built a path that avoided obstacles in both static and dynamic conditions. …”
Get full text
Get full text
Get full text
Article -
15
Dynamic object replica placement using underlying routing protocols: ensuring the reliability
Published 2013“…The issues of choosing the best path for placing the replica that provides the minimum latency and reliability of contents transmission can be overcome by combining the EIGRP features that includes internetwork delay, bandwidth consumption, reliability of packet transmission and traffic load, with dynamic replica placement algorithm.…”
Get full text
Get full text
Get full text
Get full text
Proceeding Paper -
16
Wormhole attack detection mechanism in mobile ad hoc network using neighborhood information and path tracing algorithm
Published 2015“…Throughput and packet overhead is improved in the NIPT algorithm with an average of 4% and 6% respctively over the PT algorithm. …”
Get full text
Get full text
Thesis -
17
Controller placement problem in the optimization of 5G based SDN and NFV architecture
Published 2021“…Furthermore, the approach is extended with a Particle Swarm Algorithm (PSO) and presented as a hybrid RASCP to validate the optimal location and number of controllers. …”
Get full text
Get full text
Thesis -
18
-
19
Autonomous navigation robot using slam and path planning based on a Single RP-LIDAR
Published 2025“…The approach was evaluated in a laboratory environment (11 meter by 8 meter) and successfully built a path that avoided obstacles in both static and dynamic conditions. …”
Get full text
Get full text
Get full text
Article -
20
EFFICIENT DYNAMIC ADDRESSING BASED ROUTING FOR UNDERWATER WIRELESS SENSOR NETWORKS
Published 2011“…Considering the node mobility as a challenging task, a distributed routing scheme called Hop-by-Hop Dynamic Addressing Based (H2- DAB) routing protocol is proposed where every node in the network will be assigned a routable address quickly and efficiently without any explicit configuration or any dimensional location information. …”
Get full text
Get full text
Thesis
