Search Results - data distribution ((computer algorithm) OR (means algorithm))

Refine Results
  1. 1

    A dynamic replication aware load balanced scheduling for data grids in distributed environments of internet of things by Bakhshad, Said, Noor, Rafidah Md, Akhundzada, Adnan, Saba, Tanzila, Ahmedy, Ismail, Haroon, Faisal, Nazir, Babar

    Published 2018
    “…Grid computing is a powerful distributed and scalable computing infrastructure that deals with massive data-intensive applications. …”
    Get full text
    Get full text
    Article
  2. 2

    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.

    Published 2025
    “…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. …”
    Article
  3. 3

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

    Published 2019
    “…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
    Thesis
  4. 4

    An improvement on the valiantbrebner hypercube data broadcasting technique / Nasaruddin Zenon by Zenon, Nasaruddin

    Published 1990
    “…The intended meaning of broadcasting there is the mannereach datum is distributed among the processors in a computer system. …”
    Get full text
    Get full text
    Article
  5. 5

    Dynamic replication aware load blanced scheduling in distributed environment / Said Bakhshad by Said Bakhshad, Bakhshad

    Published 2018
    “…Grid computing is an effective distributed and adaptable processing network that manages a huge number of data applications. …”
    Get full text
    Get full text
    Get full text
    Thesis
  6. 6

    Final exam question paper data encryption and decryption using advance encryption standard / Khairul Nashran Nazari by Nazari, Khairul Nashran

    Published 2017
    “…AES is a data encryption technique that exist in the world with as currently the most secured algorithms. …”
    Get full text
    Get full text
    Thesis
  7. 7

    Estimation Of Weibull Parameters Using Simulated Annealing As Applied In Financial Data by Hamza, Abubakar

    Published 2023
    “…The finding reveals that the Weibull distribution is well-suited to describing the investment behaviour of the MPS based on the estimates via the SA algorithm. …”
    Get full text
    Get full text
    Thesis
  8. 8
  9. 9

    Replica Creation Algorithm for Data Grids by Madi, Mohammed Kamel

    Published 2012
    “…This thesis presents a new replication algorithm that improves data access performance in data grids by distributing relevant data copies around the grid. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  10. 10
  11. 11
  12. 12

    Coordinate-Descent Adaptation over Hamiltonian Multi-Agent Networks by Azam Khalili, Vahid Vahidpour, Amir Rastegarnia, Ali Farzamnia, Teo, Kenneth Tze Kin, Saeid Sanei

    Published 2021
    “…The incremental least-mean-square (ILMS) algorithm is a useful method to perform distributed adaptation and learning in Hamiltonian networks. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  13. 13

    Dynamic Robust Bootstrap Algorithm for Linear Model Selection Using Least Trimmed Squares by Uraibi, Hassan Sami

    Published 2009
    “…One of the important assumptions of the linear model is that the error terms are normally distributed. Unfortunately, many researchers are not aware that the performance of the OLS can be very poor when the data set that one often makes a normal assumption, has a heavy-tailed distribution which may arise as a result of the presence of outliers. …”
    Get full text
    Get full text
    Thesis
  14. 14

    Autonomous anomaly detection using density-based features in streaming data / Muhammmad Yunus Iqbal Basheer by Iqbal Basheer, Muhammmad Yunus

    Published 2023
    “…Consequently, to handle these data, computer algorithms must adapt to their characteristics. …”
    Get full text
    Get full text
    Thesis
  15. 15

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

    Generic DNA encoding design scheme to solve combinatorial problems by Rofilde, Hasudungan

    Published 2015
    “…DNA encoding is the first important step in DNA computing phases. Currently, data encoding in DNA computing is tightly coupled with an algorithm that solves an instance of the problem. …”
    Get full text
    Get full text
    Thesis
  18. 18
  19. 19

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

    Published 2019
    “…The error measurements of the proposed method such as Mean Absolute Percentage Error, Mean Absolute Error, And Root Mean Square Error for islanding detection are less than 0.02% for ideal and noisy conditions which shows that the algorithm is not sensitive to noise. …”
    Get full text
    Get full text
    Thesis
  20. 20