Search Results - (( course evaluation based algorithm ) OR ( parameter adoption case algorithm ))

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

“…Addressing this issue, this paper proposes the adoption of parameter free optimization algorithms as the basis of future t-way strategies. …”
Get full text
Get full text
Get full text

Dynamic Probability Selection for Flower Pollination Algorithm based on Metropolis-hastings Criteria by Zamli, Kamal Zuhairi, Din, Fakhrud, Nasser, Abdullah, Ramli, Nazirah, Mohamed, Noraini

“…Flower Pollination Algorithm (FPA) is a relatively new meta-heuristic algorithm that adopts its metaphor from the proliferation role of flowers in plants. …”
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

“…Although useful, all aforementioned t-way strategies have assumed sequence-less interactions amongst input parameters. In the case of reactive systems, such an assumption is invalid as some parameter operations, or events, occur in sequence and hence, creating a possibility of bugs or faults triggered by the order, or sequence, of input parameters. …”
Get full text
Get full text

One Parameter at a time Combinatorial Testing Strategy Based on Harmony Search Algorithm OPAT-HS by Al-Sewari, Abdul Rahman Ahmed Mohammed, Mu’aza, Aminu Aminu, Rassem, Taha H., Tairan, Nasser M., Shah, Habib, Kamal Z., Zamli

“…Even though there are some existing optimization algorithm based combinatorial testing strategies, that minimize the number of test cases, but most of these strategies based on one-test-at-a-time (OTAT) approach and none of them has adopted the one-parameter-at-a-time (OPAT) approach. …”
Get full text
Get full text
Get full text

Dynamic probability selection for flower pollination algorithm based on metropolis-hastings criteria by Zamli, Kamal Zuhairi, Din, Fakhrud, Nasser, Abdullah, Ramli, Nazirah, Mohamed, Noraini

“…Flower Pollination Algorithm (FPA) is a relatively new meta-heuristic algorithm that adopts its metaphor from the proliferation role of flowers in plants. …”
Get full text
Get full text
Get full text

Automated study plan generator using rule-based and knapsack problem by Salahuddin, Lizawati, Hashim, Ummi Rabaah, Salahuddin, Lizawati

“…A quantitative methodology through expert’s reviews and questionnaire survey was conducted to evaluate the accuracy of the proposed algorithm. The proposed algorithm shows high accuracy. …”
Get full text
Get full text
Get full text

Using algorithmic taxonomy to evaluate lecturer workload by Hashim, Ruhil Hayati, Abdul Hamid, Jamaliah, Selamat, Mohd Hasan, Ibrahim, Hamidah, Abdullah, Rusli, Mohayidin, Mohd Ghazali

“…Results of the study highlight the contributions of this algorithmic method in better evaluation of teaching workload for lecture.…”
Get full text
Get full text
Get full text

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.

“…Although useful, most of the aforementioned t-way strategies have assumed sequence-less interactions amongst input parameters. In the case of reactive system, such an assumption is invalid as some parameter operations (or events) occur in sequence and hence, creating a possibility of bugs triggered by the order (or sequence) of input parameters. …”
Get full text
Get full text
Get full text

Using web questionnaire for web-based course evaluation: advantages and disadvantages by Fariborzi, Elham, Abu Bakar, Kamariah, Kasa, Zakaria, Abu Samah, Bahaman, Abdullah, Muhammad Taufik

“…This article examines some advantages and disadvantages of conducting Web survey research especially for Web-based course evaluation at Iranian university E-learning centers. …”
Get full text
Get full text

Investigation of Meta-heuristics Algorithms in ANN Streamflow Forecasting by Wei Y., Hashim H., Chong K.L., Huang Y.F., Ahmed A.N., El-Shafie A.

“…However, among the adopted MHAs, not all are compatible with optimizing the ANN for streamflow forecasting, thus requiring a thorough study as performance varies from case to case. …”

Using algorithmic taxonomy to evaluate lecture workload: a case study of services application prototype in the UPM KM Portal by Abdul Hamid, Jamaliah, Mohayidin, Mohd Ghazali, Selamat, Mohd Hasan, Ibrahim, Hamidah, Abdullah, Rusli, Hashim, Ruhil Hayati

“…Results of the study highlight the contributions of this algorithmic method in better evaluation of teaching workload for lecture.…”
Get full text
Get full text

Enhancing harmony search parameters based on step and linear function for bus driver scheduling and rostering problems by Mansor, Nur Farraliza

“…Optimization is a major challenge in numerous practical world problems.According to the “No Free Lunch (NFL)” theorem,there is no existing single optimizer algorithm that is able to resolve all issues in an effective and efficient manner.It is varied and need to be solved according to the specific capabilities inherent to certain algorithms making it hard to foresee the algorithm that is best suited for each problem.As a result,the heuristic technique is adopted for this research as it has been identified as a potentially suitable algorithm.Alternative heuristic algorithms are also suggested to obtain optimal solutions with reasonable computational effort.However,the heuristic approach failed to produce a solution that nears optimum when the complexity of a problem increases;therefore a type of nature-inspired algorithm known as meta-euristics which utilises an intelligent searching mechanism over a population is considered and consequently used.The meta-heuristic approach is widely used to substitute heuristic terms and is broadly applied to address problems with regards to driver scheduling.However,this meta-heuristic technique is still unable to address the fairness issue in the scheduling and rostering problems.Hence,this research proposes a strategy to adopt an amendment of the harmony search algorithm in order to address the fairness issue which in turn will escalate the level of fairness in driver scheduling and rostering.The harmony search algorithm is classified as a meta-heuristics algorithm that is capable of solving hard and combinatorial or discrete optimisation problems.In this respect,the three main operators in harmony search,namely the Harmony Memory Consideration Rate (HMCR),Pitch Adjustment Rate (PAR) and Bandwidth (BW) play a vital role in balancing local exploitation and global exploration.These parameters influence the overall performance of the HS algorithm,and therefore it is crucial to fine-tune them. …”
Get full text
Get full text
Get full text

Assessing the chaotic map population initializations for sine cosine algorithm using the case study of pairwise test suite generation by Din, Fakhrud, Kamal Zuhairi, Zamli, Abdullah, Nasser

“…The main strength of SCA is its simplicity and straightforward implementation as well as provides no parameter control adjustment. For these reasons, SCA can be adopted in many optimization problems quickly and without much tuning. …”
Get full text
Get full text
Get full text
Get full text

Review of Nature Inspired Metaheuristic Algorithm Selection for Combinatorial t-way Testing by Muazu, A.A., Hashim, A.S., Sarlan, A.

“…This research paper outlines hundred and ten (110) outstanding nature-inspired metaheuristic algorithms for the last decades (2001 and 2021) such as Coronavirus Optimization Algorithm, Ebola Optimization Algorithm, Harmony Search, Tiki-Taka Algorithm, and so on. …”
Get full text
Get full text

Using algorithmic taxonomy to evaluate lecture workload: A case study of services application prototype in the UPM KM portal by Abdul Hamid, Jamaliah, Mohayidin, Mohd Ghazali, Selamat, Mohd Hassan, Ibrahim, Hamidah, Abdullah, Rusli, Hashim, Ruhil Hayati

“…Lecturer workload at universities includes three major categories: teaching, research and services.Teaching workload is influence by various factors such as level taught courses, number of student, credit and contact hour and off campus or on campus course design.The UPM has a KM Portal that contains sets of metadata on lecturer profile and knowledge assets.The Lecturer profile contains information lecturer teaching, research, publication and many more.We constructed an algorithmic taxonomy based at the lecturer profile data to measure lecturer teaching workload.This method measures the lecturer teaching workload.The taxonomy is a dynamic hierarchy that extracts validated parameters from the dataset.Results of the study highlight the contributions of this algorithmic method in better evaluation of teaching workload for lecture.…”
Get full text
Get full text
Get full text

Combinatorial test suites generation strategy utilizing the whale optimization algorithm by Ali Abdullah, Hassan, Salwani, Abdullah, Kamal Zuhairi, Zamli, Rozilawati, Razali

“…To address this issue, combinatorial t-way testing (where t indicates the interaction strength, i.e. the number of interacting parameters (input)) was adopted to minimize the number of cases for testing. …”
Get full text
Get full text
Get full text

Grid portal technology for web based education of parallel computing courses, applications and researches by Alias, Norma, Islam, Md. Rajibul, Mydin, Suhaimi, Hamzah, Norhafiza, Safiza Abd. Ghaffar, Zarith, Satam, Noriza, Darwis, Roziha

“…These courses will actively engage the students in exploring the concepts of the development the parallel algorithm in visualizing the grand challenge applications of mathematical problems. …”
Get full text
Get full text

Exploration and Exploitation Mechanism in Pairwise Test Case Generation: A Systematic Literature Review by Yahaya, Muhammad Sabo, Hashim, Ahmad Sobri B., Oluwagbemiga Balogun, Abdullateef, Aminu Muazu, Aminu, Sabo Usman, Fatima, Adamu Aliyu, Dahiru, Uwaisu Muhammad, Abdullahi

“…This review systematically examines the role of metaheuristic algorithms in pairwise test case generation, focusing on their exploration and exploitation mechanisms to address local optima challenges. …”
Get full text
Get full text

Enhancing CI engine performance and emission control using a hybrid RSM–Rao algorithm for ZnO-doped castor–neem biodiesel blends by Zhu, Chao-zhe, Samuel, Olusegun D., Patel G C, Manjunath, Der, Oguzhan, Abbas, Mohamed, Hussain, Fayaz, Ting, Tin Tin

“…Traditional optimization methods, like Response Surface Methodology (RSM) alone, have failed to capture the complexities of engine operation, leading to the adoption of a more efficient algorithmic approach that requires no algorithm-specific parameters. …”
Get full text
Get full text
Get full text

Design and development of elective courses recommender system (ECORS) by Eng, Pei Wen

“…A rule-based algorithm is chosen to use in this project. …”
Get full text
Get full text
Get full text