Search Results - (( data optimization max algorithm ) OR ( data replication using algorithm ))

Refine Results
  1. 1

    Reactive max-min ant system: An experimental analysis of the combination with K-OPT local searches by Sagban, Rafid, Ku-Mahamud, Ku Ruhana, Abu Bakar, Muhamad Shahbani

    Published 2015
    “…The exploration versus exploitation dilemma rises in ACO search.Reactive max-min ant system algorithm is a recent proposition to automate the exploration and exploitation.It memorizes the search regions in terms of reactive heuristics to be harnessed after restart, which is to avoid the arbitrary exploration later.This paper examined the assumption that local heuristics are useless when combined with local search especially when it applied for combinatorial optimization problems with rugged fitness landscape.Results showed that coupling reactive heuristics with k-Opt local search algorithms produces higher quality solutions and more robust search than max-min ant system algorithm.Well-known combinatorial optimization problems are used in experiments, i.e. traveling salesman and quadratic assignment problems. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  2. 2

    An improvement of stochastic gradient descent approach for mean-variance portfolio optimization problem by S. W. Su, Stephanie, Kek, Sie Long

    Published 2021
    “…Furthermore, the applicability of SGD, Adam, AdaMax, Nadam, AMSGrad, and AdamSE algorithms in solving the mean-variance portfolio optimization problem is validated.…”
    Get full text
    Get full text
    Get full text
    Article
  3. 3

    Maximum 2-satisfiability in radial basis function neural network by Shehab Abdulhabib Alzaeemi, Saratha Sathasivam, Mohd Shareduwan Mohd Kasihmuddin, Mohd. Asyraf Mansor

    Published 2020
    “…In this study, the effectiveness of RBFNN-MAX2SAT can be estimated by evaluating the proposed models with testing data sets. …”
    Get full text
    Get full text
    Get full text
    Article
  4. 4

    Relationship based replication algorithm for data grid by Yusof, Yuhanis

    Published 2014
    “…The Relationship based Replication algorithm aims to improve the Data Grid performance by reducing the job execution time, bandwidth and storage usage.The RBR was realized using a network simulation (OptorSim) and experiment results revealed that it offers better performance than existing replication algorithms.…”
    Get full text
    Get full text
    Monograph
  5. 5
  6. 6

    Managing Fragmented Database Using BVAGQ-AR Replication Model by Ainul Azila, Che Fauzi, Noraziah, Ahmad, Tutut, Herawan, Z., Abdullah, Gupta, Ritu

    Published 2017
    “…Problem arises when the database is packed with data, but it has lacked of knowledge. If the unreasonable data is used in database replication, it will cause waste of data storage and delay the time taken for a replication process. …”
    Get full text
    Get full text
    Get full text
    Article
  7. 7

    Binary Vote Assignment on Cloud Quorum Algorithm for Fragmented MyGRANTS Database Replication by Noraziah, Ahmad, Ainul Azila, Che Fauzi, Herawan, Tutut, Zailani, Abdullah

    Published 2015
    “…Data replication is one of the mechanisms to manage data since it improves data accessibility and reliability. …”
    Get full text
    Get full text
    Get full text
    Article
  8. 8

    Managing MyGRANTS Fragmented Database Using Binary Vote Assignment Grid Quorum with Association Rule (BVAGQ-AR) Replication Model by Noraziah, Ahmad, Wan Maseri, Wan Mohd, Ainul Azila, Che Fauzi

    Published 2015
    “…Nevertheless, if the impractical data is used in database replication, this will cause waste of data storage and the time taken for a replication process will be delayed. …”
    Get full text
    Get full text
    Conference or Workshop Item
  9. 9
  10. 10
  11. 11

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

    Published 2008
    “…For improving the performance of file accesses and to ease the sharing amongst distributed collaboration, such a system needs replication services. 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
  12. 12
  13. 13

    A Comparative Study of Z-Score and Min-Max Normalization for Rainfall Classification in Pekanbaru by Rahmad Ramadhan, Laska, Anne Mudya, Yolanda

    Published 2024
    “…Data preprocessing plays a crucial role in enhancing the performance of machine learning algorithms for classification tasks. …”
    Get full text
    Get full text
    Get full text
    Article
  14. 14

    A novel deadlock detection algorithm for neighbour replication on grid environment by Noriyani, Mohd Zin

    Published 2012
    “…The use of three to five transactions is in NRG the data will be replicated into three to five sites. …”
    Get full text
    Get full text
    Thesis
  15. 15

    Prediction and multi-criteria-based schemes for seamless handover mechanism in mobile WiMAX networks by Mubarak, Mohammed Awadh Ahmed Ben

    Published 2013
    “…Mobile WiMAX introduces several interesting advantages including last mile wireless access, variable and high data rate, point to multi-point communication, large frequency range and QoS (Quality of Service) for various types of applications. …”
    Get full text
    Get full text
    Thesis
  16. 16

    Energy-efficient base station transmission design for green 5G massive MIMO and hybrid networks by Khodamoradi, Vahid

    Published 2021
    “…The proposed algorithm maximizes the EE by jointly optimizing the minimum data rate requirement, the number of BS antennas and users. …”
    Get full text
    Get full text
    Thesis
  17. 17

    Improvement of Centralized Routing and Scheduling Using Cross-Layer Design and Multi-Slot Assignment in Wimax Mesh Networks by Al-Humairi, Ali Zuhair Abdulameer

    Published 2009
    “…This thesis proposes an optimized strategy namely cross-layer design in routing algorithms used find the best route for all SSs and scheduling algorithms, used to assign a time slot for each possible node transmission. …”
    Get full text
    Get full text
    Thesis
  18. 18

    BVAGQ-AR for Fragmented Database Replication Management by N., Ahmad, Ainul Azila, Che Fauzi, Sharifah Hafizah, Sy Ahmad Ubaidillah, Al-Kazemi, Basem, Odili, Julius Beneoluchi

    Published 2021
    “…Although we have been packed with data, we still have lacked of knowledge. Nevertheless, if the impractical data is used in database replication, this will cause waste of data storage and the time taken for a replication process will be delayed. …”
    Get full text
    Get full text
    Get full text
    Article
  19. 19

    Data normalization techniques in swarm-based forecasting models for energy commodity spot price by Yusof, Yuhanis, Mustaffa, Zuriani, Kamaruddin, Siti Sakira

    Published 2014
    “…Data mining is a fundamental technique in identifying patterns from large data sets.The extracted facts and patterns contribute in various domains such as marketing, forecasting, and medical.Prior to that, data are consolidated so that the resulting mining process may be more efficient.This study investigates the effect of different data normalization techniques.which are Min-max, Z-score and decimal scaling, on Swarm-based forecasting models.Recent swarm intelligence algorithms employed includes the Grey Wolf Optimizer (GWO) and Artificial Bee Colony (ABC).Forecasting models are later developed to predict the daily spot price of crude oil and gasoline.Results showed that GWO works better with Z-score normalization technique while ABC produces better accuracy with the Min-Max.Nevertheless, the GWO is more superior than ABC as its model generates the highest accuracy for both crude oil and gasoline price.Such a result indicates that GWO is a promising competitor in the family of swarm intelligence algorithms.…”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  20. 20

    Statistical data preprocessing methods in distance functions to enhance k-means clustering algorithm by Dalatu, Paul Inuwa

    Published 2018
    “…The suggested approaches are called new approach to min-max (NAMM) and decimal scaling (NADS). The Hybrid mean algorithms which are based on spherical clusters is also proposed to remedy the most significant limitation of the K-Means and K-Midranges algorithms. …”
    Get full text
    Get full text
    Get full text
    Thesis