Search Results - (( parallel distribution issues algorithm ) OR ( parameter adoption based algorithm ))

Parallel distributed genetic algorithm development based on microcontrollers framework by Krishnan P.S., Kiong T.S., Koh J.

“…This work is focused on the implementation of evolutionary based computer algorithms, genetic algorithms (GAs), on microcontrollers. …”

The visualization of three dimensional brain tumors' growth on distributed parallel computer systems by Alias, Norma, Masseri, Mohd. Ikhwan Safa, Islam, Md. Rajibul, Khalid, Siti Nurhidayah

“…The main objective of this study is to visualize the brain tumors’ growth in three-dimensional and implement the algorithm on distributed parallel computer systems. …”
Get full text
Get full text

Topology-aware hypergraph based approach to optimize scheduling of parallel applications onto distributed parallel architectures by Koohi, Sina Zangbari

“…The first step lies at the modelling of parallel applications running on heterogeneous parallel computers. …”
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.

“…In doing so, this paper reviews two existing parameter free optimization algorithms involving Teaching Learning Based Optimization (TLBO) and Fruitfly Optimization Algorithm (FOA) in an effort to promote their adoption for CIT.…”
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

“…In line with the emerging field called Search based Software Engineering, many recently developed t-way strategies have adopted meta-heuristic algorithms as the basis of their implementations such as Simulated Annealing, Genetic Algorithm, Ant Colony Optimization Algorithm, Particle Swarm Optimization, Harmony Search and Cuckoo Search, owing their superior performance in term of test size reduction as compared to general computational based strategies, such as General t-way, Test Vector Generator, In Parameter Order General, Jenny, and Automatic Efficient Test Generator. …”
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

“…This paper proposed flower pollination algorithm metropolis-hastings (FPA-MH) based on the adoption of Metropolis-Hastings criteria adopted from the Simulated Annealing (SA) algorithm to enable dynamic selection of the pa probability. …”
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.

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

Parallel computing via message passing: comparison between Microsoft MPI and Klyng framework / Nik Nasrul Faiz Nik Yahaya by Nik Yahaya, Nik Nasrul Faiz

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

“…This paper proposed flower pollination algorithm metropolis-hastings (FPA-MH) based on the adoption of Metropolis-Hastings criteria adopted from the Simulated Annealing (SA) algorithm to enable dynamic selection of the pa probability. …”
Get full text
Get full text
Get full text

A fuzzy adaptive teaching learning-based optimization strategy for generating mixed strength t-way test suites by Din, Fakhrud

“…Owing to its proven performance in many other optimization problems, the adoption of the parameter-free Teaching Learning-based Optimization (TLBO) algorithm as a new t-way strategy is deemed useful. …”
Get full text
Get full text

Regenerative braking strategy for electric vehicles using improved adaptive genetic algorithm by Taleghani, Hussein

“…One uses Standard Genetic Algorithm (SGA), the second strategy uses Improved Adaptive Genetic Algorithm (IAGA). …”
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
Get full text

Adaptive resource allocation for reliable performance in heterogeneous distributed systems. by Hussin, Masnida, Abdullah, Azizol, K. Subramaniam, Shamala

Get full text

Evaluation of outlier filtering algorithms for accurate measurement of travel time reliability incorporating lane-splitting situations / Obada M. A. Asqool by Obada , M. A. Asqool

“…The parameters of the Jang algorithm and TransGuide algorithm were sensitive for different days. …”
Get full text
Get full text
Get full text

Weighting method for modal parameter based damage detection algorithms by Fayyadh, M.M., Abdul Razak, H.

Get full text
Get full text

Finite impulse response optimizers for solving optimization problems by Ab Rahman, Tasiransurini

“…In this work, three new estimation-based metaheuristic algorithms are introduced. The first algorithm is a single-agent-based algorithm, named Single-agent FIR optimizer (SAFIRO). …”
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

Finite impulse response optimizers for solving optimization problems by Tasiransurini, Ab Rahman

“…In this work, three new estimation-based metaheuristic algorithms are introduced. The first algorithm is a single-agent-based algorithm, named Single-agent FIR optimizer (SAFIRO). …”
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

“…The experimental results of the test-suite generation indicate that WOA produces competitive outcomes compared to some selected single-based and population-based metaheuristic algorithms.…”
Get full text
Get full text
Get full text

Automatic control of flotation process using computer vision by Saravani, Ali Jahed

“…The performance of improved marker based watershed algorithm was validated by using several industrial and laboratory froth images. …”
Get full text
Get full text