Search Results - (( developing interactive pollination algorithm ) OR ( java implementation path algorithm ))

An elitist-flower pollination-based strategy for constructing sequence and sequence-less t-way test suite by Abdullah, Nasser, Kamal Z., Zamli, Alsewari, Abdulrahman A., Ahmed, Bestoun S.

“…In line with the upcoming of a new field called search-based software engineering (SBSE), many newly developed t-way strategies adopting meta-heuristic algorithms can be seen in the literature for constructing interaction test suite (such as simulated annealing (SA), genetic algorithm (GA), ant colony optimisation algorithm (ACO), particle swarm optimisation (PSO), harmony search (HS) and cuckoo search (CS). …”
Get full text
Get full text
Get full text

Sequence and sequence-less t-way test suite generation strategy based on the elitist flower pollination algorithm by Mohammed Abdullah, Abdullah Nasser

“…If t-way strategies are to be adopted in such a system, there is also a need to support test data generation based on sequence of interactions. Addressing these aforementioned issues and complementing the existing sequence based strategies such as t-SEQ, Sequence Covering Array Generator and Bee Algorithm, this thesis presents a unified strategy based on the new meta-heuristic algorithm, called the Elitist Flower Pollination Algorithm (eFPA). …”
Get full text
Get full text

Hybrid flower pollination algorithm strategies for t-way test suite generation by Abdullah, Nasser, Kamal Z., Zamli, Alsewari, Abdulrahman A., Ahmed, Bestoun S.

“…Consequently, many useful meta-heuristic algorithms have been developed on the basis of the implementation of t-way strategies (where t indicates the interaction strength). …”
Get full text
Get full text
Get full text

Heavy Transportation Shortest Route using Dijkstra’s algorithm (HETRO) / Nurul Aqilah Ahmad Nezer by Ahmad Nezer, Nurul Aqilah

“…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

Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization by Mohammad Ata, Karimeh Ibrahim

“…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

Path planning for unmanned aerial vehicle (UAV) using rotated accelerated method in static outdoor environment by Shaliza Hayati A. Wahab, Nordin Saad, Azali Saudi, Ali Chekima

“…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

Sequence and sequence-less T-way test suite generation strategy based on flower pollination algorithm by Abdullah, Nasser, Hujainah, Fadhl, Alsewari, Abdulrahman A., Kamal Z., Zamli

Get full text
Get full text
Get full text

Smart appointment organizer for mobile application / Mohd Syafiq Adam by Adam, Mohd Syafiq

“…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

Performance properties optimization of triaxial ceramic-palm oil fuel ash by employing Taguchi design and flower pollination algorithm by Zainudin, Azlan

“…In the meantime, both linear and interaction approach of FPA developed following optimal parameters: 5 wt.% of ground POFA, pressed at 4 t, and sintered at 1200 °C for 300 min of soaking time. …”
Get full text
Get full text
Get full text
Get full text

A Unified Strategy for Sequence and Sequence-less T-way Test Suite Generation by Abdullah, Nasser, Hujainah, Fadhl, Alsewari, Abdulrahman A., Kamal Z., Zamli

“…In the last 20 years, many useful t-way strategies (where t indicates the interaction strength) have been developed to help generate test suite for detecting fault due to interaction of inputs. …”
Get full text
Get full text
Get full text

Assessing optimization based strategies for t-way test suite generation: The case for flower-based strategy by Abdullah, Nasser, Sariera, Yazan A., Alsewari, Abdulrahman A., Kamal Z., Zamli

“…Addressing this issue, the adoption of t-way testing (where t indicates the interaction strength) has come into the limelight. In order to summarize the achievements so far and facilitate future development, the main focus of this paper is, first, to present a critical comparison of adoption optimization algorithms (OA) as a basis of the t-way test suite generation strategy and, second, to propose a new t-way strategy based on Flower Pollination Algorithm, called Flower Strategy (FS). …”
Get full text
Get full text
Get full text

Hyper-heuristic strategy for input-output-based interaction testing by Din, Fakhrud, Kamal Zuhairi, Zamli

“…Classical test case design strategies, however, do not sufficiently include support for exploration of faults due to interaction between parameter values. New strategies known as t-way strategies (where t expresses interaction strength) have been developed for finding interaction faults. …”
Get full text
Get full text
Get full text
Get full text

Evolutionary cost-cognizant regression test case prioritization for object-oriented programs by Bello, AbdulKarim

“…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