| 1. |
- Ahmed, Bestoun S., 1982-, et al.
(författare)
-
A new approach to speed up combinatorial search strategies using stack and hash table
- 2016
-
Ingår i: Proceedings of 2016 SAI Computing Conference, SAI 2016. - : Institute of Electrical and Electronics Engineers (IEEE). - 9781467384605 ; , s. 1217-1222
-
Konferensbidrag (refereegranskat)abstract
- Owing to the significance of combinatorial search strategies both for academia and industry, the introduction of new techniques is a fast growing research field these days. These strategies have really taken different forms ranging from simple to complex strategies in order to solve all forms of combinatorial problems. Nonetheless, despite the kind of problem these approaches solve, they are prone to heavy computation with the number of combinations and growing search space dimensions. This paper presents a new approach to speed up the generation and search processes using a combination of stack and hash table data structures. This approach could be put to practice for the combinatorial approaches to speed up the generation of combinations and search process in the search space. Furthermore, this new approach proved its performance in diverse stages better than other known strategies. © 2016 IEEE.
|
|
| 2. |
- Nasser, A. B., et al.
(författare)
-
Dynamic solution probability acceptance within the flower pollination algorithm for combinatorial t-way test suite generation
- 2019
-
Ingår i: Intelligent and Interactive Computing. - Singapore : Springer. ; , s. 3-11
-
Konferensbidrag (refereegranskat)abstract
- In this paper, the enhanced Flower Pollination Algorithm (FPA) algorithm, called imFPA, has been proposed. Within imFPA, the static selection probability is replaced by the dynamic solution selection probability in order to enhance the intensification and diversification of the overall search process. Experimental adoptions on combinatorial t-way test suite generation problem (where t indicates the interaction strength) show that imFPA produces very competitive results as compared to existing strategies. © Springer Nature Singapore Pte Ltd. 2019.
|
|
| 3. |
- Zamli, K. Z., et al.
(författare)
-
Software module clustering based on the fuzzy adaptive teaching learning based optimization algorithm
- 2019
-
Ingår i: Lecture Notes in Networks and Systems. - Singapore : Springer. ; , s. 167-177
-
Konferensbidrag (refereegranskat)abstract
- Although showing competitive performances in many real-world optimization problems, Teaching Learning based Optimization Algorithm (TLBO) has been criticized for having poor control on exploration and exploitation. Addressing these issues, a new variant of TLBO called Adaptive Fuzzy Teaching Learning based Optimization (ATLBO) has been developed in the literature. This paper describes the adoption of Fuzzy Adaptive Fuzzy Teaching Learning based Optimization (ATLBO) for software module clustering problem. Comparative studies with the original Teaching Learning based Optimization (TLBO) and other Fuzzy TLBO variant demonstrate that ATLBO gives superior performance owing to its adaptive selection of search operators based on the need of the current search. © Springer Nature Singapore Pte Ltd. 2019.
|
|
