Search Results - (( a distribution means algorithm ) OR ( parameter destination a algorithm ))

Beta Distribution Weighted Fuzzy C-Ordered-Means Clustering by Hengda, Wang, Mohamad Mohsin, Mohamad Farhan, Mohd Pozi, Muhammad Syafiq

“…The fuzzy C-ordered-means clustering (FCOM) is a fuzzy clustering algorithm that enhances robustness and clustering accuracy through the ordered mechanism based on fuzzy C-means (FCM). …”
Get full text
Get full text
Get full text
Get full text

Modified K-Nearest Neighborhood Algorithm For Optimal Selection Of Distribution Centre In The Disaster Relief Operation by Siti Nabilah Basarang

Modelling of multi-robot system for search and rescue by Poy, Yi Ler

“…The PSO algorithm functions as a global path planner, determining the complete path for each robot, whereas a sensor-based obstacle avoidance algorithm serves as a local planner to avoid collision with dynamic obstacles during navigation. …”
Get full text
Get full text

An Improved LEACH Algorithm Based On Fuzzy C-Means Algorithm And Distributed Cluster Head Selection Mechanism. by Hassan, Ali Abdul Hussian, Othman, Mohd Fairuz Iskandar, Md Shah, Wahidah, Husien, Ali Mohamed, Hassan, Hayder Abdul Hussien

Get full text
Get full text
Get full text

Artificial Bee Colony for Minimizing the Energy Consumption in Mobile Ad Hoc Network by Tareq, M., Abed, S.A., Sundararajan, E.A.

“…The aim of this paper is to find the best possible route from the source to the destination based on a method inspired by the searching behaviour of bee colonies, i.e. artificial bee colony (ABC) algorithm. …”
Get full text
Get full text

Parallel power load abnormalities detection using fast density peak clustering with a hybrid canopy-K-means algorithm by Al-Jumaili A.H.A., Muniyandi R.C., Hasan M.K., Singh M.J., Paw J.K.S., Al-Jumaily A.

“…Parallel power loads anomalies are processed by a fast-density peak clustering technique that capitalizes on the hybrid strengths of Canopy and K-means algorithms all within Apache Mahout's distributed machine-learning environment. …”

An observation of different clustering algorithms and clustering evaluation criteria for a feature selection based on linear discriminant analysis by Tie, K. H., A., Senawi, Chuan, Z. L.

“…The k-means and the Gaussian mixture distribution were adopted as the clustering algorithms and each algorithm was tested on four datasets with four distinct clustering evaluation criteria: Calinski-Harabasz, Davies-Bouldin, Gap and Silhouette. …”
Get full text
Get full text
Get full text

Slice sampler algorithm for generalized pareto distribution by Rostami, Mohammad, Adam, Mohd Bakri, Yahya, Mohamed Hisham, Ibrahim, Noor Akma

“…In this paper, we developed the slice sampler algorithm for the generalized Pareto distribution (GPD) model. …”
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

Power-efficient wireless coverage using minimum number of uavs by Sawalmeh A., Othman N.S., Liu G., Khreishah A., Alenezi A., Alanazi A.

Review of Network on Chip Architectures by Hussin, Fawnizu Azmadi, Hamid, Nor Hisham

“…The packet traverses along these nodes to reach the destination using routing algorithm. Conclusion: In this paper, NoC architectures are reviewed using different parameters, detail information is also provided for these parameters. …”
Get full text
Get full text

Slice sampler and metropolis hastings approaches for bayesian analysis of extreme data by Rostami, Mohammad

“…A simulation study shows that the slice sampler algorithm provides posterior means with low errors for the parameters along with a high level of stationarity in iteration series. …”
Get full text
Get full text

Efficient genetic partitioning-around-medoid algorithm for clustering by Garib, Sarmad Makki Mohammed

“…One of the main issues in genetic k-means based algorithms is their sensitivity to outliers and unevenly distributed clusters due to the mean compromised computations. …”
Get full text
Get full text

Novel wide-area fault location and predictive maintenance technique for distribution system by Tan C.K., Ramachandaramurthy V.K.

“…This paper presents a reliable, automated fault location algorithm within a wide-area distribution network using a limited number of monitoring devices. …”

A genetic approach for gateway placement in wireless mesh networks by Awadallah, Hashim, Hassan Abdalla Hashim, Aisha

“…Thus, finding near optimal solution is essential to improve the net operation. This paper proposes a novel approach to solve this problem using Genetic Algorithm (GA) to achieve a near optimal solution, considering the number of IGs and the number of hops that the packet traverses between the IG and the source/ destination MR (MR-IG). …”
Get full text
Get full text
Get full text

Improved performance in distributed estimation by convex combination of DNSAF and DNLMS algorithms by Ahmad Pouradabi, Amir Rastegarnia, Azam Khalili, Ali Farzamnia

“…Diffusion normalized least mean square (DNLMS) algorithm has low misadjustment error, but it is slow in convergence. …”
Get full text
Get full text
Get full text
Get full text

Comparison of DSR, AODV and DSDV routing protocols in mobile ad-hoc networks: A survey by Abdala, Tarek Mosbah, Dasalla, Valeriano A., Daud, Nasarudin

“…A mobile ad hoc network (MANET) is a collection of mobile nodes that is connected through a wireless medium forming rapidly changing topologies.Mantes are infrastructure less and can be set up anytime, anywhere.We have conducted survey of protocol properties of various MANET routing algorithms and analyzed them.The routing algorithms considered are classified into three categories proactive (table driven) , reactive (on demand) and Hybrid protocol.The algorithms considered are Dynamic Source Routing (DSR), Ad-hoc On-Demand Distance Vector Routing (AODV) and Destination sequence Vector (DSDV) have been proposed to solve the multi hop routing problem in Ad-hoc networks.The comparison among three routing protocols are based on the various protocol property parameters such as Routing overhead, packet delivery ratio, end-to-end delay, path optimality, and throughput are some metrics commonly used in the comparisons.…”
Get full text
Get full text
Get full text

Optimizing crystal size distribution based on different cooling strategies in batch crystallization process by Siti Zubaidah, Adnan, Noor Asma Fazli, Abdul Samad

“…Different temperature profiles may influence the distribution of crystal products, and a suitable optimization algorithm is required to produce an optimum temperature trajectory that produces the desired CSD. …”
Get full text
Get full text
Get full text

Performance comparison between genetic algorithm and ant colony optimization algorithm for mobile robot path planning in global static environment / Nohaidda Sariff by Sariff, Nohaidda

“…In both global and local PP systems, a mobile robot should be able to navigate effectively until it reaches a destination without colliding with any obstacles within an environment. …”
Get full text
Get full text

Development of an islanding detection scheme based on combination of slantlet transform and ridgelet probabilistic neural network in distributed generation by Ahmadipour, Masoud

“…One of the challenging issues for a grid-connected distributed generation is to find a suitable technique to detect an islanding problem. …”
Get full text
Get full text