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

Refine Results
  1. 1

    A comparative performance analysis of computational intelligence techniques to solve the asymmetric travelling salesman problem by Odili, Julius Beneoluchi, Noraziah, Ahmad, Zarina, M.

    Published 2021
    “…The comparative algorithms in this study employ different techniques in their search for solutions to ATSP: the African Buffalo Optimization employs the modified Karp–Steele mechanism, Model-Induced Max-Min Ant Colony Optimization (MIMM-ACO) employs the path construction with patching technique, Cooperative Genetic Ant System uses natural selection and ordering; Randomized Insertion Algorithm uses the random insertion approach, and the Improved Extremal Optimization uses the grid search strategy. …”
    Get full text
    Get full text
    Get full text
    Article
  2. 2
  3. 3

    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
  4. 4

    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
  5. 5

    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
  6. 6

    An optimal tasks scheduling algorithm based on QoS in cloud computing network by Alhakimi, Mohammed Ameen Mohammed Abdo

    Published 2017
    “…This study presents an optimal task scheduling algorithm by enhancing Max-Min and TS algorithm. …”
    Get full text
    Get full text
    Thesis
  7. 7
  8. 8

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

    Published 2020
    “…This paper presents a new paradigm in using MAX2SAT by implementing in Radial Basis Function Neural Network (RBFNN). …”
    Get full text
    Get full text
    Get full text
    Article
  9. 9

    A comparative evaluation of heuristic and metaheuristic job scheduling algorithms for optimized resource management in cloud environments by Haque, Najmul, Zafril Rizal, M. Azmi, Murad, Saydul Akbar

    Published 2026
    “…The CloudSim simulator is applied to evaluate each algorithm using key performance metrics, including makespan, average flow time, and the number of cloudlets that fail to meet deadlines. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  10. 10
  11. 11

    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
  12. 12
  13. 13

    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
  14. 14

    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
  15. 15
  16. 16
  17. 17

    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
  18. 18

    A new minimum pheromone threshold strategy (MPTS) for max-min ant system by Wong, Kuan Yew, See, Phen Chiak

    Published 2009
    “…Among others is the ant colony optimization (ACO) algorithm, which was inspired by the foraging behavior of ants. …”
    Get full text
    Get full text
    Article
  19. 19
  20. 20