Search Results - (( using optimization _ algorithm ) OR ( using interactive process algorithm ))

A comparative study on testing optimization techniques with combinatorial interaction testing for optimizing software product line testing by Maidin, Nur Farrahin, Hassan, Sa’Adah, Baharom, Salmi, Md. Sultan, Abu Bakar

“…By using the best optimization algorithm with the optimum number of interaction strengths, the complexity of the SPL testing process could be reduced without prejudicing the quality of the software system itself.…”
Get full text
Get full text
Get full text

On Adopting Parameter Free Optimization Algorithms for Combinatorial Interaction Testing by Kamal Z., Zamli, Alsariera, Yazan A., Nasser, Abdullah B., Alsewari, Abdulrahman A.

“…Although useful, strategies based on the aforementioned optimization algorithms are not without limitation. …”
Get full text
Get full text
Get full text

Effects of Different Superpixel Algorithms on Interactive Segmentations by Soo See, Chai, Luong Goh, Kok, Weng Ng, Giap, Muzaffar, Hamzah

“…Though employed as pre-processing step in many interactive segmentation algorithms, to date, no study has been conducted to assess the effects of such incorporations on the segmentation algorithms. …”
Get full text
Get full text
Get full text

Effects of Different Superpixel Algorithms on Interactive Segmentations by Goh, Kok Luong, Ng, Giap Weng, Muzaffar Hamzah, Chai, Soo See

“…Though employed as pre-processing step in many interactive segmentation algorithms, to date, no study has been conducted to assess the effects of such incorporations on the segmentation algorithms. …”
Get full text
Get full text
Get full text
Get full text
Get full text

Optimal path planning algorithms in virtual environments by Hassan, Rohayanti

“…In addition, Extended Prim algorithm was applied to shorten the travelling time and a virtual exhibition area was used as a domain to execute and analyse the algorithms performances. …”
Get full text
Get full text

Sizes of Superpixels and their Effect on Interactive Segmentation by Goh, Kok Luong, Ng, Giap Weng, Muzaffar, Hamzah, Chai, Soo See

“…Despite the fact that it is used as a pre-processing step in many interactive segmentation algorithms, less studies had been conducted to assess the effects of the size of superpixels required by interactive segmentation algorithms to achieve an optimal result. …”
Get full text
Get full text
Get full text

Sizes of Superpixels and their Effect on Interactive Segmentation by Kok, Luong Goh, Giap, Weng Ng, Muzaffar Hamzah, Soo, See Chai

“…Despite the fact that it is used as a pre-processing step in many interactive segmentation algorithms, less studies had been conducted to assess the effects of the size of superpixels required by interactive segmentation algorithms to achieve an optimal result. …”
Get full text
Get full text
Get full text
Get full text

Sequence t-way test generation using the barnacles mating optimizer algorithm by Kamal Z., Zamli, Kader, Md. Abdul

“…More precisely, we focus on the generation of test cases due to the ordering of inputs (or sequence) using the newly developed Barnacles Mating Optimizer (BMO) Algorithm. …”
Get full text
Get full text
Get full text
Get full text

Hybrid Artificial Bees Colony Algorithms For Optimizing Carbon Nanotubes Characteristics by Mohammad Jarrah, Mu'ath Ibrahim

“…Optimization is a crucial process to select the best parameters in single and multi-objective problems for manufacturing process.However,it is difficult to find an optimization algorithm that obtain the global optimum for every optimization problem.Artificial Bees Colony (ABC) is a well-known swarm intelligence algorithm in solving optimization problems.It has noticeably shown better performance compared to the state-of-art algorithms.This study proposes a novel hybrid ABC algorithm with β-Hill Climbing (βHC) technique (ABC-βHC) in order to enhance the exploitation and exploration process of the ABC in optimizing carbon nanotubes (CNTs) characteristics.CNTs are widely used in electronic and mechanical products due to its fascinating material with extraordinary mechanical,thermal,physical and electrical properties. …”
Get full text
Get full text
Get full text
Get full text

VISUALIZATION OF GENETIC ALGORITHM BASED ON 2-D GRAPH TO ACCELERATE THE SEARCHING WITH HUMAN INTERVENTIONS. by FAROOQ, HUMERA

“…Visualization techniques help in understanding the searching behaviour of Genetic Algorithm. lt also makes possible the user interactions during the searching process. …”
Get full text
Get full text

Automated bilateral negotiation with incomplete information in the e-marketplace. by Jazayeriy, Hamid

“…The MGT algorithm is useful to explore the properties of the Pareto-optimal offers. …”
Get full text
Get full text

Adapting the Elitism on the Greedy Algorithm for Variable Strength Combinatorial Test Cases Generation by Bahomaid, Ameen A., Alsewari, Abdulrahman A., Zamli, Kamal Z., Alsariera, Yazan A.

“…This study presented the most recent variable interaction strength (VS) CT strategy using an enhanced variant in the greedy algorithm. …”
Get full text
Get full text
Get full text

Enhancing Harmony Search Metaheuristic Algorithm for Coverage Efficiency, Test Suite Reduction, and Running Time in Combinatorial Interaction Testing by Muazu, Aminu Aminu, Hashim, Ahmad Sobri

“…Optimization has developed powerful algorithms for solving complex problems efficiently. …”
Get full text
Get full text

An integration of AHP-ACO technique for social interaction and travel planning by Peh, Perly Thai Ee

“…This study presents the integration methods of AHP algorithm for point of interest decision-making and ACO and rule-based algorithms for route optimization. …”
Get full text
Get full text
Get full text
Get full text

Proposed algorithm for scheduling in computational grid using backfilling and optimization techniques by Dakkak, Omar, Awang Nor, Shahrudin, Che Mohamed Arif, Ahmad Suki

Get full text
Get full text
Get full text

Optimization of biochemical systems production using combination of newton method and particle swarm optimization by Mohd Arfian, Ismail, Mezhuyev, Vitaliy, Irfan, Darmawan, Shahreen, Kasim, Mohd Saberi, Mohamad, Ashraf Osman, Ibrahim

“…The justification of choosing PSO algorithm is its direct implementation and effectiveness in the optimization process. …”
Get full text
Get full text
Get full text

Web based personalized university timetable for UiTM students using genetic algorithm / Mohd Radhi Fauzan Jamli and Ahmad Firdaus Ahmad Fadzil by Jamli, Mohd Radhi Fauzan, Ahmad Fadzil, Ahmad Firdaus

“…Future work entails enhancing system robustness through comprehensive contingency planning, real-time data integration, and algorithmic optimization, with a focus on refining the genetic algorithm and exploring parallel processing techniques to further enhance efficiency and scalability.…”
Get full text
Get full text
Get full text

CPU Burst Processes Prioritization Using Priority Dynamic Quantum Time Algorithm: A Comparison with Varying Time Quantum and Round Robin Algorithms by Mohammed, Maysoon A., Mazlina, Abdul Majid, Balsam, A. Mustafa, Ghani, Rana Fareed

“…In Round-Robin Scheduling, the time quantum is fixed and processes are scheduled such that no process uses CPU time more than one time quantum in one go. …”
Get full text
Get full text
Get full text

Social media mining: a genetic based multiobjective clustering approach to topic modelling by Alfred, Rayner, Loo, Yew Jie, Obit, Joe Henry, Lim, Yuto, Haviluddin, Haviluddin, Azman, Azreen

“…However, less works have been conducted in applying multiobjective based algorithm for topic extraction. Most of these algorithms are not optimized, even if they are, they are only optimized by using a single objective method and may underperform when solving real-world problems which are typically multi-objectives in nature. …”
Get full text
Get full text

Solving computational algorithm using CLONALNet technique based on artificial clonal selection by Samy J.A.L.A., Krishnan P.S.A.L., Kiong T.S.

“…This paper discusses the approach of CLONALNet in determining the optimum fitness function and mean population by benchmarking it with CLONALG. By using this algorithm the steps to obtain the fitness function is optimized and processing time is reduced. …”