Search Results - (( java application optimization algorithm ) OR ( _ modification path algorithm ))
Search alternatives:
- application optimization »
- modification path »
- java application »
- path algorithm »
-
1
Modification of dijkstra's algorithm for safest and shortest path during emergency evacuation
Published 2015“…Therefore, this paper presents the methodology used for the modification of Dijkstra's algorithm to find the safest and shortest path. …”
Get full text
Get full text
Get full text
Article -
2
Optimization of blood vessel detection in retina images using multithreading and native code for portable devices
Published 2013Get full text
Get full text
Conference or Workshop Item -
3
Performance evaluation of real-time multiprocessor scheduling algorithms
Published 2016“…These results suggests that optimal algorithms may turn to be non-optimal when practically implemented, unlike USG which reveals far less scheduling overhead and hence could be practically implemented in real-world applications. …”
Get full text
Get full text
Conference or Workshop Item -
4
Shortest Path Trajectory System Based on Dijkstra Algorithm
Published 2012“…This project includes the modification of main algorithm which has been implemented in the prototype development. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
5
Route Optimization System
Published 2005“…After much research into the many algorithms available, and considering some, including Genetic Algorithm (GA), the author selected Dijkstra's Algorithm (DA). …”
Get full text
Get full text
Final Year Project -
6
Optimization Of Two-Dimensional Dual Beam Scanning System Using Genetic Algorithms
Published 2008“…The simulation results indicate that the algorithm is able to segregate and assign the tasks for each scanning head and also able to find the shortest scanning path for different types of objects coordination. …”
Get full text
Get full text
Thesis -
7
-
8
A review on path planning and obstacle avoidance algorithms for autonomous mobile robots
Published 2022“…This paper reviews the mobile robot navigation approaches and obstacle avoidance used so far in various environmental conditions to recognize the improvement of path planning strategists. Taking into consideration commonly used classical approaches such as Dijkstra algorithm (DA), artificial potential field (APF), probabilistic road map (PRM), cell decomposition (CD), and meta-heuristic techniques such as fuzzy logic (FL), neutral network (NN), particle swarm optimization (PSO), genetic algorithm (GA), cuckoo search algorithm (CSO), and artificial bee colony (ABC). …”
Get full text
Get full text
Get full text
Get full text
Article -
9
Graph processing hardware accelerator for shortest path algorithms in nanometer very large-scale integration interconnect routing
Published 2007“…In order to utilize the high performance hardware priority queue module, modifications have to be made on the graph-based shortest path algorithm. …”
Get full text
Get full text
Get full text
Thesis -
10
Attribute reduction based scheduling algorithm with enhanced hybrid genetic algorithm and particle swarm optimization for optimal device selection
Published 2022“…Enhance hybrid genetic algorithm and particle Swarm optimization are developed to select the optimal device in either fog or cloud. …”
Get full text
Get full text
Article -
11
Enhancing performance of global path planning for mobile robot through Alpha–Beta Guided Particle Swarm Optimization (ABGPSO) algorithm
Published 2025“…Experiments were carried out in four different layouts related to path-planning environments, and comparisons were made with various existing path-planning algorithms. …”
Get full text
Get full text
Get full text
Article -
12
Integration of enchanced jump point search (JPS) algorithm with modified bresenham technique for path planning in virtual grid-based environment
Published 2018“…Jump Point Search is one of the path finding algorithm with huge advantage of maintaining zero memory overhead as no preprocessing process involved. …”
Get full text
Get full text
Get full text
Thesis -
13
Research on risk detection of autonomous vehicle based on rapidly-exploring random tree
Published 2023“…A non-particle collision detection (NPCD) collision detection algorithm and path modification (PM) path modification strategy are proposed for the collision risk in the turning process, and geometric constraints are used to represent the possible security threats, so as to improve the efficiency and safety of vehicle global path driving and to provide reference for the research of driverless vehicles.…”
Get full text
Get full text
Get full text
Get full text
Article -
14
Ant colony optimization algorithm for load balancing in grid computing
Published 2012Get full text
Get full text
Get full text
Monograph -
15
Modelling Autonomous Evacuation Navigation System (AENS) for optimal route using Dijkstra's algorithm
Published 2016“…Through ST adaptation, all subsystems were integrated and using the “Dijkstra’s algorithm” (DA) by modifying its function from shortest path algorithm to safest and shortest algorithm, to the nearest exit. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
16
Multi agent quality of service routing based on scheme ant colony optimization algorithm
Published 2014“…This study also introduces a new probe-based procedure for discovery and setup QoS path for real-time traffic. The proposed scheme has been simulated by OMNET++ and compared with standard AntNet and two well-known standard QoS routings; Widest Shortest Path (WSP) algorithm and Shortest Widest Path (SWP) algorithm. …”
Get full text
Get full text
Thesis -
17
-
18
Computer Lab Timetabling Using Genetic Algorithm Case Study - Unit ICT
Published 2006“…Genetic Algorithm is one of the most popular optimization solutions used in various applications such as scheduling. …”
Get full text
Get full text
Thesis -
19
Design, development and performance optimization of a new artificial intelligent controlled multiple-beam optical scanning module
Published 2006“…This research presents a new approach to optimise the performance of a multiple-beam optical scanning system in terms of its marking combinations and speed, using Genetic Algorithm (GA). The problem has been decomposed into two sub problems; task segregation, where the marking 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 minimise the total motion of marking time. …”
Get full text
Get full text
Get full text
Article -
20
