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

Embedded parallel distributed artificial intelligent processors for adaptive beam forming in WCDMA system by Krishnan P.S., Kiong T.S., Koh J., Yap D.

Subjects:

Parallel algorithms for numerical simulations of EHD ion-drag micropump on distributed parallel computing systems by Shakeel Ahmed, Kamboh

“…To implement the parallel algorithms a distributed parallel computing laboratory using easily available low cost computers is setup. …”
Get full text
Get full text

High performance visualization of human tumor growth software by Alias, Norma, Mohd. Said, Norfarizan, Khalid, Siti Nur Hidayah, Sin, Dolly Tien Ching, Phang, Tau Ing

“…The platform for high performance computing of the parallel algorithms run on a distributed parallel computer system. …”
Get full text
Get full text
Get full text

High performance simulation for brain tumors growth using parabolic equation on heterogeneous parallel computer systems by Pheng, H. S., Alias, Norma, Mohd. Said, Norfarizan

“…This paper focuses on the implementation of parallel algorithm for the simulation of brain tumours growth using one dimensional parabolic equation, design on a distributed parallel computer system. …”
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

High performance simulation for brain tumours growth using parabolic equation on heterogeneous parallel computer system by Pheng H. S., Norma Alias, Norfarizan Mohd Said

“…This paper focuses on the implementation of parallel algorithm for the simulation of brain tumours growth using one dimensional parabolic equation, design on a distributed parallel computer system. …”
Get full text
Get full text
Get full text

WCDMA teletraffic performance improvement via power resource optimization using distributed parallel genetic algorithm by Prajindra S.K., Tiong S.K., Johnny Koh S.P., Yap D.F.W.

“…The algorithm works by finding the minimum transmitter power with the help of Distributed Parallel Genetic Algorithm (DPGA) employed on an offload microcontroller system to form optimal beam coverage to reduce power usage of adaptive antenna at WCDMA base station. …”

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

A critical analysis of simulators in grid by Dakkak, Omar, Che Mohamed Arif, Ahmad Suki, Awang Nor, Shahrudin

“…In parallel and distributed computing environment such as "The Grid", anticipating the behavior of the resources and tasks based on certain scheduling algorithm is a great challenging.Thus, studying and improving these types of environments becomes very difficult. …”
Get full text
Get full text
Get full text

Implementation of Parallel K-Means Algorithm to Estimate Adhesion Failure in Warm Mix Asphalt by Akhtar, M.N., Ahmed, W., Kakar, M.R., Bakar, E.A., Othman, A.R., Bueno, M.

“…The results showed that the PKIP algorithm decreases the execution time up to 30 to 46 if compared with the sequential k means algorithm when implemented using multiprocessing and distributed computing. …”
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

Distributed parallel deep learning with a hybrid backpropagation-particle swarm optimization for community detection in large complex networks by Shing, Chiang Ta, Mohammed Al-Andoli, Mohammed Nasser, Wooi, Ping Cheah

“…In addition, a distributed environment is set up to conduct parallel optimization of the proposed method so that multi-local optimizations could be performed simultaneously. …”
Get full text
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

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

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

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

Automatic generic process migration system in linux by Zarrabi, Amirreza

“…A fexible interface to the underlying checkpoint/ restart subsystem is designed which permits users to specify the migration mechanism according to process constraints. A migration algorithm is designed which attempts to exploit the unique features of the basic migration algorithms to form a generic algorithm. …”
Get full text
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