Search Results - (( data distribution some algorithm ) OR ( pre evaluation ((bat algorithm) OR (_ algorithm)) ))

Refine Results
  1. 1

    A Hybrid Least Squares Support Vector Machine with Bat and Cuckoo Search Algorithms for Time Series Forecasting by Mohammed, Athraa Jasim, Ghathwan, Khalil Ibrahim, Yusof, Yuhanis

    Published 2020
    “…Hence, to enhance the search ability of Cuckoo Search, it is integrated with Bat algorithm that offers a balanced search between global and local. …”
    Get full text
    Get full text
    Article
  2. 2

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

    Published 2013
    “…The data distributed in these systems sometimes come in inconsistent formats. …”
    Get full text
    Get full text
    Thesis
  3. 3

    Instance matching framework for heterogeneous semantic web content over linked data environment by Mansir, Abubakar

    Published 2021
    “…The output of each algorithm is evaluated, the results have shown that each algorithm performs well and outperforms the existing algorithms on all test cases in terms better output generation and effective handling of heterogeneity from different domains, which is a necessary concern in all data-intensive problems. …”
    Get full text
    Get full text
    Thesis
  4. 4

    Uncertainty estimation for improving accuracy of non-rigid registration in cardiac images by Mazaheri, Samaneh, Sulaiman, Puteri Suhaiza, Wirza, Rahmita, Dimon, Mohd Zamrin, Khalid, Fatimah, Tayebi, Rohollah Moosavi

    Published 2015
    “…A challenging but important problem in image registration is evaluating the performance of a registration algorithm. …”
    Get full text
    Get full text
    Get full text
    Book Section
  5. 5

    Dynamic replication algorithm in data grid: Survey by K. Madi, Mohammed, Hassan, Suhaidi

    Published 2008
    “…Data replication is a common method used to improve the performance of data access in distributed systems. …”
    Get full text
    Get full text
    Get full text
    Book Section
  6. 6

    Multi-Objectives Memetic Discrete Differential Evolution Algorithm for Solving the Container Pre-Marshalling Problem by Mustafa, Hossam M. J., Ayob, Masri, Ahmad Nazri, Mohd Zakree, Abu-Taleb, Sawsan

    Published 2019
    “…In addition, it improves the exploration and exploitation capabilities of the algorithm. The standard pre-marshalling benchmark dataset (i.e., Bortfeldt-Forster) is used to evaluate the effectiveness of the proposed algorithm. …”
    Get full text
    Get full text
    Article
  7. 7
  8. 8

    Some families of count distributions for modelling zero-inflation and dispersion / Low Yeh Ching by Low, Yeh Ching

    Published 2016
    “…A popular distribution for the modelling of discrete count data is the Poisson distribution. …”
    Get full text
    Get full text
    Thesis
  9. 9
  10. 10

    Machine learning in botda fibre sensor for distributed temperature measurement by Nur Dalilla binti Nordin

    Published 2023
    “…To make the sensor more reliable, temperature data must be collected over the length of the cable, or distributed data rather than point data. …”
    text::Thesis
  11. 11

    Design and Implementation of Data-at-Rest Encryption for Hadoop by Wan Nor Shuhadah, Wan Nik, Mohamad Afendee, Mohamed, Zarina, Mohamad, Siti Hanisah, Kamaruzaman

    Published 2017
    “…It is shown that the implementation of AES encryption algorithm is capable to secure data stored in HDFS to some extent.…”
    Get full text
    Get full text
    Conference or Workshop Item
  12. 12

    Design and Implementation of Data-at-Rest Encryption for Hadoop by Wan Nor Shuhadah, Wan Nik, Mohamad Afendee, Mohamed, Zarina, Mohamad, Siti Hanisah, Kamaruzaman

    Published 2017
    “…It is shown that the implementation of AES encryption algorithm is capable to secure data stored in HDFS to some extent.…”
    Get full text
    Get full text
    Conference or Workshop Item
  13. 13

    The Performance of Chlorophyll-a Distribution Estimation by Using Ratio Algorithm on Landsat-8 in Sungai Merbok Estuary / Jesse Vince Rabing ... [et al.] by Rabing, Jesse Vince, Abd.Aziz, Khairul Naim, Kamaruddin, Sharir Aizat, Roslani, Muhammad Akmal, Tajam, Jamil, Ahmad, Aziani, Nazri, Rosnani, Zainol, Zamzila Erdawati, Ramli, Rohayu, Shaari, Mohd Idrus

    Published 2022
    “…This study explores the applicability of ratio algorithms for estimation of the chl- a concentration at Sungai Merbok by assessing chl-a distribution pattern built by the algorithms and evaluating each algorithm for their errors compared to in-situ data. …”
    Get full text
    Get full text
    Get full text
    Article
  14. 14

    Adaptive grid-meshed-buffer clustering algorithm for outlier detection in evolving data stream by Abdulateef, Alaa Fareed

    Published 2023
    “…The results indicate that the AGMB algorithm outperformed existing benchmark algorithms in terms of predefined evaluation criteria with an overall 72% accuracy compared to benchmark algorithms which is 11 % only. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  15. 15

    A simulation study of a parametric mixture model of three different distributions to analyze heterogeneous survival data by Mohammed, Yusuf Abbakar, Yatim, Bidin, Ismail, Suzilah

    Published 2013
    “…In this paper a simulation study of a parametric mixture model of three different distributions is considered to model heterogeneous survival data.Some properties of the proposed parametric mixture of Exponential, Gamma and Weibull are investigated.The Expectation Maximization Algorithm (EM) is implemented to estimate the maximum likelihood estimators of three different postulated parametric mixture model parameters.The simulations are performed by simulating data sampled from a population of three component parametric mixture of three different distributions, and the simulations are repeated 10, 30, 50, 100 and 500 times to investigate the consistency and stability of the EM scheme.The EM Algorithm scheme developed is able to estimate the parameters of the mixture which are very close to the parameters of the postulated model.The repetitions of the simulation give parameters closer and closer to the postulated models, as the number of repetitions increases, with relatively small standard errors.…”
    Get full text
    Get full text
    Get full text
    Article
  16. 16

    EEG-and MRI-based epilepsy source localization using multivariate empirical mode decomposition and inverse solution method by Khosropanah, Pegah

    Published 2018
    “…The accuracy of ESL depends on all the stages of data processing including: head model reconstruction, signal pre-processing and inverse solution. Therefore, a standardized algorithm with less supervision is desired to utilize ESL for pre-surgical evaluation. …”
    Get full text
    Get full text
    Thesis
  17. 17

    Solving the vehicle routing problem with stochastic demands via hybrid genetic algorithm-tabu search by Ismail, Zuhaimy, Irhamah, Irhamah

    Published 2008
    “…The relative performance of the proposed HGATS is compared to each GA and TS alone, on a set of randomly generated problems following some discrete probability distributions. The problem data are inspired by real case of VRPSD in waste collection. …”
    Get full text
    Get full text
    Article
  18. 18

    Survey on job scheduling mechanisms in grid environment by S. M., Argungu, Che Mohamed Arif, Ahmad Suki, Omar, Mohd Hasbullah

    Published 2015
    “…Grid systems provide geographically distributed resources for both computational intensive and data-intensive applications.These applications generate large data sets.However, the high latency imposed by the underlying technologies; upon which the grid system is built (such as the Internet and WWW), induced impediment in the effective access to such huge and widely distributed data.To minimize this impediment, jobs need to be scheduled across grid environments to achieve efficient data access.Scheduling multiple data requests submitted by grid users onto the grid environment is NP-hard.Thus, there is no best scheduling algorithm that cuts across all grids computing environments.Job scheduling is one of the key research area in grid computing.In the recent past many researchers have proposed different mechanisms to help scheduling of user jobs in grid systems.Some characteristic features of the grid components; such as machines types and nature of jobs at hand means that a choice needs to be made for an appropriate scheduling algorithm to march a given grid environment.The aim of scheduling is to achieve maximum possible system throughput and to match the application needs with the available computing resources.This paper is motivated by the need to explore the various job scheduling techniques alongside their area of implementation.The paper will systematically analyze the strengths and weaknesses of some selected approaches in the area of grid jobs scheduling.This helps researchers better understand the concept of scheduling, and can contribute in developing more efficient and practical scheduling algorithms.This will also benefit interested researchers to carry out further work in this dynamic research area.…”
    Get full text
    Get full text
    Get full text
    Article
  19. 19

    A spawn mobile agent itinerary planning approach for energy-efficient data gathering in wireless sensor networks by Q. Qadori, Huthiafa, Ahmad Zulkarnain, Zuriati, Mohd Hanapi, Zurina, Subramaniam, Shamala

    Published 2017
    “…Moreover, each distributed MA has to carry the processing code (data aggregation code) to collect the sensory data and return back to the sink with the accumulated data. …”
    Get full text
    Get full text
    Get full text
    Article
  20. 20

    Effects of Different Superpixel Algorithms on Interactive Segmentations by Soo See, Chai, Luong Goh, Kok, Weng Ng, Giap, Muzaffar, Hamzah

    Published 2022
    “…Superpixel can be defined as a collection of pixels that share common features such as texture and colours. Though employed as pre-processing step in many interactive segmentation algorithms, to date, no study has been conducted to assess the effects of such incorporations on the segmentation algorithms. …”
    Get full text
    Get full text
    Get full text
    Article