Search Results - (( parallel estimation methods algorithm ) OR ( pre optimization based algorithm ))

Parallel visualization approach of a 3D heart model by Malekpour, A., Ling, T.C., Lim, W.C.

Get full text
Get full text

Digital quadrature compensators scheme for analog imperfections of quadrature modulator in wireless communication systems by Talebpour, Faraz

“…Offline on the other hand, is a mode where adaptive algorithms cannot estimate the imperfections in parallel with the transmission. …”
Get full text
Get full text

Optimizing Cloud Storage Costs: Introducing the Pre-Evaluation-Based Cost Optimization (PECSCO) Mechanism by Alomari M.F., Mahmoud M.A., Gharaei N., Rasool S.M., Hasan R.A.

“…The core of the algorithm utilizes a Genetic Algorithm (GA) to find the optimal position for the first evaluator by minimizing the total distance between this evaluator and all CCTV nodes, aiming for surveillance efficiency. …”

One day ahead daily peak hour load forecasting by using invasive weed optimization learning algorithm based Artificial Neural Network by Rahim, Muhammad Fitri

“…Hence, this indicates that Invasive Weed Optimization could be implemented as a new learning algorithm for an Artificial Neural Network.…”
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

“…In this study, five different types of superpixels ranging from watershed, density, graph, clustering and energy optimization categories are evaluated. The superpixels generated by these five algorithms will be used on two interactive image segmentation algorithms: i) Maximal Similarity based Region Merging (MSRM) and ii) Graph-Based Manifold Ranking (GBMR) with single and multiple strokes on various images from the Berkeley image dataset. …”
Get full text
Get full text
Get full text

A Novel Wrapper-Based Optimization Algorithm for the Feature Selection and Classification by Talpur, N., Abdulkadir, S.J., Hasan, M.H., Alhussian, H., Alwadain, A.

“…Moreover, K-Nearest Neighbor (KNN) classifier was used to evaluate the effectiveness of the features identified by the proposed SCSO algorithm. The performance of the proposed SCSO algorithm was compared with six state-of-the-art and recent wrapper-based optimization algorithms using the validation metrics of classification accuracy, optimum feature size, and computational cost in seconds. …”
Get full text
Get full text

Improved opposition-based particle swarm optimization algorithm for global optimization by Nafees Ul Hassan, Waqas Haider Bangyal, M. Sadiq Ali Khan, Kashif Nisar, Ag. Asri Ag. Ibrahim, Danda B. Rawat

“…Particle Swarm Optimization (PSO) has been widely used to solve various types of optimization problems. …”
Get full text
Get full text
Get full text
Get full text
Get full text

Adaptive Fast Orthogonal Search (FOS) algorithm for forecasting streamflow by Osman A., Afan H.A., Allawi M.F., Jaafar O., Noureldin A., Hamzah F.M., Ahmed A.N., El-shafie A.

Feature selection based on particle swarm optimization algorithm for sentiment analysis classification by Nurcahyawati, Vivine, Mustaffa, Zuriani

“…An improved approach was proposed to increase the sentiment analysis accuracy based on text pre-processing and Naïve Bayes Classifier algorithm hybrid with Particle Swarm Optimization (NBC-PSO). …”
Get full text
Get full text
Get full text
Get full text

Document clustering for knowledge discovery using nature-inspired algorithm by Mohammed, Athraa Jasim, Yusof, Yuhanis, Husni, Husniza

“…As the internet is overload with information, various knowledge based systems are now equipped with data analytics features that facilitate knowledge discovery.This includes the utilization of optimization algorithms that mimics the behavior of insects or animals.This paper presents an experiment on document clustering utilizing the Gravitation Firefly algorithm (GFA).The advantage of GFA is that clustering can be performed without a pre-defined value of k clusters.GFA determines the center of clusters by identifying documents with high force.Upon identification of the centers, clusters are created based on cosine similarity measurement.Experimental results demonstrated that GFA utilizing a random positioning of documents outperforms existing clustering algorithm such as Particles Swarm Optimization (PSO) and K-means.…”
Get full text
Get full text
Get full text

Algorithm optimization and low cost bit-serial architecture design for integer-pixel and sub-pixel motion estimation in H.264/AVC / Mohammad Reza Hosseiny Fatemi by Hosseiny Fatemi, Mohammad Reza

“…This thesis is concerned with algorithm optimization and efficient low cost architecture design for integer motion estimation (IME) and sub-pixel motion estimation (SME) of H.264/AVC. …”
Get full text
Get full text
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

“…In this study, five different types of superpixels ranging from watershed, density, graph, clustering and energy optimization categories are evaluated. The superpixels generated by these five algorithms will be used on two interactive image segmentation algorithms: i) Maximal Similarity based Region Merging (MSRM) and ii) Graph-Based Manifold Ranking (GBMR) with single and multiple strokes on various images from the Berkeley image dataset. …”
Get full text
Get full text
Get full text
Get full text
Get full text

Early detection of breast cancer using wave elliptic equation with high performance computing by Alias, Norma, Rosly, Nur Syazana, Satam, Noriza, A. Ghaffar, Zarith Safiza, Islam, Md. Rajibul

“…This paper focuses on the implementation of parallel algorithm for the simulation of breast cancer tumor using two dimensional Helmholtz’s wave equation on a distributed parallel computer system (DPCS). …”
Get full text
Get full text
Get full text

A New Pre-Processing Technique For Computational Of Stereo Matching Algorithm by Kadmin, Ahmad Fauzan, Hamzah, Rostam Affendi, Abd Manap, Nurulfajar, Hamid, Mohd Saad

“…At the fourth stage; disparity optimization stage, the disparity map is optimized with a common local technique, Winner-Take-All (WTA). …”
Get full text
Get full text
Get full text
Get full text

Optimized clustering with modified K-means algorithm by Alibuhtto, Mohamed Cassim

“…Among the techniques, the k-means algorithm is the most commonly used technique for determining optimal number of clusters (k). …”
Get full text
Get full text
Get full text
Get full text

Automatic Number Plate Recognition on android platform: With some Java code excerpts by ., Abdul Mutholib, Gunawan, Teddy Surya, Kartiwi, Mira

“…Hence, the objective of this research is to propose suitable and optimize algorithm for ANPR system on Android mobile phone. …”
Get full text
Get full text
Get full text

Artificial intelligence to predict pre-clinical dental student academic performance based on pre-university results: a preliminary study by Lestari, Widya, Abdullah, Adilah Syahirah, Ahmad Amin, Afifah Munirah, faridah, Nur, Sukotjo, Cortino, Ismail, Azlini, mohamad ibrahim, mohamad shafiq, Insani, Nashuha, Utomo, Chandra Prasetyo

“…Pre-university CGPA was shown to be predictive of dental students’ academic performance; however, alone they did not yield optimal outcomes. …”
Get full text
Get full text
Get full text
Get full text
Get full text

Discovering optimal clusters using firefly algorithm by Mohammed, Athraa Jasim, Yusof, Yuhanis, Husni, Husniza

“…Existing conventional clustering techniques require a pre-determined number of clusters, unluckily; missing information about real world problem makes it a hard challenge.A new orientation in data clustering is to automatically cluster a given set of items by identifying the appropriate number of clusters and the optimal centre for each cluster.In this paper, we present the WFA_selection algorithm that originates from weight-based firefly algorithm.The newly proposed WFA_selection merges selected clusters in order to produce a better quality of clusters.Experiments utilising the WFA and WFA_selection algorithms were conducted on the 20Newsgroups and Reuters-21578 benchmark dataset and the output were compared against bisect K-means and general stochastic clustering method (GSCM).Results demonstrate that the WFA_selection generates a more robust and compact clusters as compared to the WFA, bisect K-means and GSCM.…”
Get full text
Get full text

Investigation of evolutionary multi-objective algorithms in solving view selection problem / Seyed Hamid Talebian by Talebian, Seyed Hamid

“…As a comparative study, the performance of the algorithms was evaluated based on various standard metrics. …”
Get full text
Get full text

Electroencephalogram signal interpretation system for mobile robot by Hasan, Intan Helina

“…After 30 GA runs, the optimal four sets of electrodes are chosen based on their coefficient of determination or r² values, where higher values contributes to higher repetition rates. …”
Get full text
Get full text