Search Results - (( basic generation x algorithm ) OR ( java implementation path algorithm ))
Search alternatives:
- java implementation »
- implementation path »
- basic generation »
- path algorithm »
- generation x »
- x algorithm »
-
1
Heavy Transportation Shortest Route using Dijkstra’s algorithm (HETRO) / Nurul Aqilah Ahmad Nezer
Published 2017“…The development tools used in developing this project is NetBeans by using Java for the implementation of the coding. The methodology that used for developing this system is the Dijkstra’s algorithm. …”
Get full text
Get full text
Thesis -
2
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 -
3
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 -
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
-
6
AnkPlex: algorithmic structure for refinement of near-native ankyrin-protein docking
Published 2017“…A dataset of APKs was generated from seven X-ray APKs, which consisted of 3 internal domains, using the reliable docking tool ZDOCK. …”
Get full text
Get full text
Article -
7
-
8
-
9
-
10
-
11
Penggunaan penggugusan subtraktif bagi menjana peraturan kabur
Published 2005“…Based on the study, it is found that the system was able to generate 8 cluster center at on 30(3x10) data value at 0.3 cluster radius and also able to generate 4 cluster center at 0.5 radius with average MSE of 0.005…”
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“…The second approach is the modification of heuristic computation using original A* and modified Bresenham. Bresenham Line Algorithm is a line generation algorithm using integer arithmetic where the points (x1, y1) and (x2, y2) are assumed not equal and integer valued. …”
Get full text
Get full text
Get full text
Thesis -
13
-
14
-
15
Determination of power flow and loss allocation using superposition theory method
Published 2011Get full text
Article -
16
Evolutionary cost-cognizant regression test case prioritization for object-oriented programs
Published 2019“…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 -
17
-
18
Penggunaan penggugusan subtraktif bagi menjana peraturan kabur
Published 2005“…Based on this study, it is found that the system was able to generate 8 cluster center on 30 (3 x 10) data value at 0.3 cluster radius and also able to generate 4 cluster center at 0.5 radit.rs with average MSE of 0.005). …”
Get full text
Get full text
Get full text
Article -
19
Transcriptomic Study of Gracilaria Changii (Gracilariales, Rhodophyta) By Expressed Sequence Tags and Cdna Microarray Approach
Published 2009“…The putative identity of TUGs was identified by using Basic Local Alignment Search Tool X (BLASTX) algorithm and classified according to the functional groups in Kyoto Encyclopedia of Genes and Genomes (KEGG). …”
Get full text
Get full text
Thesis -
20
Solving power system state estimation using orthogonal decomposition algorithm / Tey Siew Kian
Published 2009“…This optimal state estimate and corrected data base are then used by the security monitoring and operation and control functions of the center.Most state estimation programs in practical use are formulated as overdetermined systems (Pozrikidis, 2008) of nonlinear equations and solved as weighted least square problems (refer to section 2.1.1).This research involves finding the least squares solution of the power system state estimation problem, HTR-1HDx = HTR-1 [z - f (x)] (refer to section 2.3.1) and to develop a program to implement the said algorithm. …”
Get full text
Get full text
Get full text
Get full text
Get full text
Get full text
Get full text
Get full text
Get full text
Get full text
Get full text
Get full text
Get full text
Get full text
Get full text
Get full text
Get full text
Get full text
Get full text
Get full text
Get full text
Get full text
Get full text
Get full text
Get full text
Thesis
