Search Results - (( developing _ efficient algorithm ) OR ( java implementation path algorithm ))
Search alternatives:
- java implementation »
- implementation path »
- path algorithm »
-
1
Heavy Transportation Shortest Route using Dijkstra’s algorithm (HETRO) / Nurul Aqilah Ahmad Nezer
Published 2017“…The major objective of this project is to develop a computerize system using Dijkstra’s algorithm to find the shortest path for heavy transportation to deliver the goods in more efficient way to save cost and fast delivery. …”
Get full text
Get full text
Thesis -
2
Path planning for unmanned aerial vehicle (UAV) using rotated accelerated method in static outdoor environment
Published 2021“…In this study, a fast iterative method known as Rotated Successive Over-Relaxation (RSOR) is introduced. The algorithm is implemented in a self-developed 2D Java tool, UAV Planner. …”
Get full text
Get full text
Get full text
Get full text
Article -
3
Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization
Published 2019“…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
Thesis -
4
Smart appointment organizer for mobile application / Mohd Syafiq Adam
Published 2009“…The main component of this prototype is the use of Dijkstra algorithm to compute the shortest path from source of appointment to the 6 points of destinations within UiTM Shah Alam. …”
Get full text
Get full text
Thesis -
5
Evolutionary cost-cognizant regression test case prioritization for object-oriented programs
Published 2019“…The recent trend of software development uses OO paradigm. Therefore, this study proposed a cost-cognizant TCP approach for object-oriented software that uses path-based integration testing to identify the possible execution path extracted from the Java System Dependence Graph (JSDG) model of the source code using forward slicing technique. …”
Get full text
Get full text
Thesis -
6
Algorithm analyzer to check the efficiency of codes
Published 2011“…Efficiency of codes developed is always an issue in software development. …”
Get full text
Get full text
Conference or Workshop Item -
7
Efficient Sequential and Parallel Routing Algorithms in Optical Multistage Interconnection Network
Published 2005“…The first approach is to develop an efficient sequential algorithm for the window method. …”
Get full text
Get full text
Thesis -
8
Optimization of assembly line balancing with energy efficiency by using tiki-taka algorithm
Published 2023“…In the modeling phase, all the ALB-EE optimization objectives are presented in a mathematical form to earn line efficiency and energy utilization. Then, the TTA is developed before undergoing functionality tests by benchmarking with Particle Swarm Optimization (PSO), Grey Wolf Optimization (GWO), Genetic Algorithm (GA), and Whale Optimization Algorithm (WOA). …”
Get full text
Get full text
Thesis -
9
Efficient genetic partitioning-around-medoid algorithm for clustering
Published 2019“…Adopting the medoid instead of the mean can enhance the efficiency. However, the complexity of the kmedoid based algorithms in general is more than the complexity of the k-means based algorithms. …”
Get full text
Get full text
Thesis -
10
Simulation of shortest path using a-star algorithm / Nurul Hani Nortaja
Published 2004“…Nonetheless, the A • algorithm do have some unique properties which is more efficient in finding the shortest path especially in human real-world problem. …”
Get full text
Get full text
Thesis -
11
A fast and efficient crosstalk-free algorithm for routing in optical multistage interconnection networks
Published 2008“…To evaluate the performance of the new algorithm, a crosstalk-free version of the original ZeroXY algorithm is developed extended from the Improved ZeroXY algorithm, called the Modified ZeroXY algorithm. …”
Get full text
Get full text
Conference or Workshop Item -
12
Approximate maximum clique algorithm (AMCA): A clever technique for solving the maximum clique problem through near optimal algorithm for minimum vertex cover problem
Published 2018“…Results: The development of an efficient approximation algorithm for the Maximum Clique (MC) problem is very difficult due to its complex nature. …”
Get full text
Get full text
Get full text
Get full text
Article -
13
A filtering algorithm for efficient retrieving of DNA sequence
Published 2009“…An automaton-based algorithm is used to develop the filtering process proposed. …”
Get full text
Get full text
Get full text
Article -
14
Efficiency and fairness of new-additive increase multiplicative decrease congestion avoidance and control algorithm
Published 2011“…In addition, to evaluate the effect of using the AIMD algorithm after its development to measure the efficiency and fairness and find new enhancement results for our approach, which named as the New-AIMD algorithm. …”
Get full text
Get full text
Get full text
Article -
15
Pengesan lalu lintas dengan kaedah pemerosesan imej
Published 2001“…This study was conducted to develop efficient traffic detector using image-processing with a personal compute I: Traffic images were captured using ordinary analogue video camera and digitised using a video blastel: Four algorithms were developed i. e. algorithm for traffic counting, algorithm for vehicle classification. algorithm to determine the speed of the counted vehicles and algorithm for incident detection. …”
Get full text
Get full text
Article -
16
An Efficient Genetic Algorithm for Large Scale Vehicle Routing Problem Subject to Precedence Constraints
Published 2015“…Therefore, it can be stated that the genetic algorithm approach developed in this study is efficient in solving large scale vehicle routing problem subject to precedence constraints with the objective of minimizing the distance travelled.…”
Get full text
Get full text
Get full text
Article -
17
Chebyshev approximation of discrete polynomials and splines
Published 2004“…The efficiency of each algorithm developed is evaluated on the basis of the number of iterations and extreme points required for convergence, and the magnitude of the errors generated. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
18
Chebyshev approximation of discrete polynomials and splines
Published 2004“…The efficiency of each algorithm developed is evaluated on the basis of the number of iterations and extreme points required for convergence, and the magnitude of the errors generated. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
19
-
20
Development of coordinating algorithm for rendezvous task of mobile robots
Published 2023“…To accomplish this task, a coordinating algorithm was developed that allows the robots to work together in a distributed manner. …”
Get full text
Get full text
Final Year Project / Dissertation / Thesis
