Search Results - (( development case function algorithm ) OR ( java implementation path algorithm ))
Search alternatives:
- java implementation »
- implementation path »
- function algorithm »
- development case »
- path algorithm »
- case function »
-
1
Evolutionary cost-cognizant regression test case prioritization for object-oriented programs
Published 2019“…Afterward evolutionary algorithm (EA) was employed to prioritize test cases based on the rate severity of fault detection per unit test cost. …”
Get full text
Get full text
Thesis -
2
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 -
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
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 -
5
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 -
6
The Development Of A Robust Algorithm For Uav Path Planning In 3d Environment
Published 2016“…Thus, a new algorithm known as infection evolution (IE) was developed in this study. …”
Get full text
Get full text
Thesis -
7
Hybrid Artificial Bees Colony algorithms for optimizing carbon nanotubes characteristics
Published 2018“…Chemical Vapor Deposition (CVD) is the most efficient method for CNTs production.However,using CVD method encounters crucial issues such as customization,time and cost.Therefore,Response Surface Methodology (RSM) is proposed for modeling and the ABC-βHC is proposed for optimization purpose to address such issues.The selected CNTs characteristics are CNTs yield and quality represented by the ratio of the relative intensity of the D and G-bands (ID/IG).Six case studies are generated from collected dataset including four cases of CNTs yield and one case of ID/IG as single objective optimization problems,while the sixth case represents multi-objective problem.The input parameters of each case are a subset from the set of input parameters including reaction temperature,duration,carbon dioxide flow rate,methane partial pressure,catalyst loading,polymer weight and catalyst weight.The models for the first three case studies were mentioned in the original work.RSM is proposed to develop polynomial models for the output responses in the other three cases and to identi significant process parameters and interactions that could affect the CNTs output responses.The developed models are validated using t-test,correlation and pattern matching.The predictive results have a good agreement with the actual experimental data.The models are used as objective functions in optimization techniques.For multi-objective optimization,this study proposes Desirability Function Approach (DFA) to be integrated with other proposed algorithms to form hybrid techniques namely RSM-DFA,ABC-DFA and ABC-βHC-DFA.The proposed algorithms and other selected well-known algorithms are evaluated and compared on their CNTs yield and quality.The optimization results reveal that ABC-βHC and ABC-βHC-DFA obtained significant results in terms of success rate,required time,iterations,and function evaluations number compared to other well-known algorithms.Significantly,the optimization results from this study are better than the results from the original work of the collected dataset.…”
Get full text
Get full text
Get full text
Thesis -
8
An experimental study of neighbourhood based metaheuristic algorithms for test case generation satisfying the modified condition / decision coverage criterion
Published 2018“…Performance of each algorithm is compared in terms of number of test cases generated as well as the run time required. …”
Get full text
Get full text
Thesis -
9
Input Information in the Approximate Calculation of Two-Dimensional Integral from Highly Oscillating Functions (Irregular Case)
Published 2019“…There are the cases when input information about function is given on the set of traces of the function on planes, the set of traces of the function on lines, and the set of values of the function in the points. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
10
Development of symbolic algorithms for certain algebraic processes
Published 2007Get full text
Get full text
Get full text
Monograph -
11
Development of symbolic algorithms for certain algebraic processes
Published 2007Get full text
Get full text
Get full text
Monograph -
12
Online Programming Judge System (UOJ)
Published 2013“…Moreover, the mechanism of test cases generation using PSO algorithm is deeply analyzed. …”
Get full text
Get full text
Final Year Project -
13
Improvement and application of particle swarm optimization algorithm
Published 2025“…An ideal assignment technique assigns new duties to each functioning robot, followed by evolutionary algorithms and Particle Swarm Optimization (PSO) to design pathways to the reconfigured positions. …”
Get full text
Get full text
Article -
14
Development of multi-objective optimization methods for integrated scheduling of handling equipment (AGVs, QCs, SP-AS/RS) in automated container terminals
Published 2012“…However, the GA outperforms the SA algorithm in medium and large size test cases. Sensitivity analysis shows that value of the objective function decreases as the number of available AGVs increases. …”
Get full text
Get full text
Thesis -
15
A framework of test case prioritisation in regression testing using particle swarm-artificial bee colony algorithm
Published 2024“…TCP factors and a weighted fitness function are also used for test case optimisation. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
16
Optimization of assembly line balancing with energy efficiency by using tiki-taka algorithm
Published 2023“…Lastly, a study of the industrial case was performed as a validation of the developed model and algorithm. …”
Get full text
Get full text
Thesis -
17
Simulated Kalman Filter algorithms for solving optimization problems
Published 2019“…Its optimality has inspired the development of a metaheuristic algorithm called Heuristic Kalman Algorithm (HKA) in 2009. …”
Get full text
Get full text
Thesis -
18
T-way testing : a test case generator based on melody search algorithm
Published 2015“…This thesis is research on developing a T-Way Testing : A Test Case Generator Based On Melody Search Algorithm (TTT-MS) to generate optimum final test list. …”
Get full text
Get full text
Undergraduates Project Papers -
19
Comparative Performance Analysis of Bat Algorithm and Bacterial Foraging Optimization Algorithm using Standard Benchmark Functions
Published 2014“…Over the last 30 years, many meta-heuristic algorithms have been developed in the literature including that of Simulated Annealing (SA), Genetic Algorithm (GA), Ant Colony Optimization (ACO), Particle Swarm Optimization (PSO), Harmony Search Algorithm (HS) to name a few. …”
Get full text
Get full text
Conference or Workshop Item -
20
Inter-cell and intra-cell facility layout models under different demand environments in cellular manufacturing systems
Published 2012“…Moreover, the computation time (CPU Time) of the developed SA algorithm is significantly less than the benchmarked algorithm. …”
Get full text
Get full text
Thesis
