Search Results - (( its application using algorithm ) OR ( job application ((bees algorithm) OR (rsa algorithm)) ))*

Refine Results
  1. 1

    Multi objective bee colony optimization framework for grid job scheduling by Alyaseri, Sana, Ku-Mahamud, Ku Ruhana

    Published 2013
    “…Grid computing is the infrastructure that involves a large number of resources like computers, networks and databases which are owned by many organizations.Job scheduling problem is one of the key issues because of high heterogeneous and dynamic nature of resources and applications in the grid computing environment.Bee colony approach has been used to solve this problem because it can be easily adapted to the grid scheduling environment.The bee algorithms have shown encouraging results in terms of time and co st.In this paper a framework for multi objective bee colony optimization is proposed to schedule batch jobs to available resources where the number of jobs is greater than the number of resources.Pareto analysis and k-means analysis are integrated in the bee colony optimization algorithm to facilitate the scheduling of jobs to resources.…”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  2. 2
  3. 3

    Bee foraging behaviour techniques for grid scheduling problem by Alyaseri, Sana, Ku-Mahamud, Ku Ruhana

    Published 2013
    “…Grid computing is the infrastructure that involves a large number of resources like computers, networks and databases which are owned by many organizations.These resources are collected together to make a huge computing power.Job scheduling problem is one of the key issues in grid computing and failing to look into grid scheduling results in uncompleted view of the grid computing.Achieving optimized performance of grid system, and matching application requirements with available computing resources, are the objectives of grid job scheduling.Bee colony approaches are more adaptive to grid scheduling due to high heterogeneous and dynamic nature of resources and applications in grid.These algorithms have shown encouraging results in terms of time and cost.This paper presents some resent research activities inspired by bee foraging behavior for grid job scheduling especially ABC and BCO approaches.Different original studies related to this area are briefly described along with their comparisons against them and results.The review summary of their derived algorithms and research efforts is done.…”
    Get full text
    Get full text
    Get full text
    Article
  4. 4
  5. 5

    Structural Equation Modeling Algorithm and Its Application in Business Analytics by Sorooshian, Shahryar

    Published 2017
    “…Novelty of this article is in modified steps of SEM application in modeling strategies, also in its developed practical comprehensive SEM application flowchart This article is a roadmap for business advisors and those scholars trying to compute SEM for their decision making, complex modeling and data analysis programming, …”
    Get full text
    Get full text
    Get full text
    Book Chapter
  6. 6

    Fast decryption method for a Rabin primitive-based cryptosystem by Asbullah, Muhammad Asyraf, Kamel Ariffin, Muhammad Rezal

    Published 2014
    “…The Chinese Remainder Theorem (CRT) is an algorithm for solving linear congruence system into a unique representation and has been a useful tool in applications of cryptography. …”
    Get full text
    Get full text
    Get full text
    Article
  7. 7
  8. 8

    Orthogonal least square algorithm and its application for modelling suspension system by Ahmad, Robiah, Jamaluddin, Hishamuddin

    Published 2001
    “…The derivation of the algorithm is presented and its application to the modelling of a car suspension system is included to demonstrate the effectiveness of the algorithm.…”
    Get full text
    Get full text
    Get full text
    Article
  9. 9

    Schelkunoff array synthesis methods using adaptive-iterative algorithm by Abdul Latiff, Nurul Mu'azzah

    Published 2003
    “…By the co-emergence of these algorithms, a better performance and wider application are hoped to be achieved since each of these algorithms has its own advantages respectively. …”
    Get full text
    Get full text
    Get full text
    Thesis
  10. 10

    Bees algorithm for Forest transportation planning optimization in Malaysia by Jamaluddin, Jamhuri, Kamarudin, Norizah, Ismail, Mohd Hasmadi, Ahmad, Siti Azfanizam

    Published 2021
    “…Algorithm is widely used in various areas due to its ability to solve classes of problems. …”
    Get full text
    Get full text
    Article
  11. 11

    A multi-objective Spiral Dynamic algorithm and its application for PD design by Ahmad Nor Kasruddin, Nasir, Mohd Ashraf, Ahmad, A. R.A., Azwan, Mohd Falfazli, Mat Jusof

    Published 2017
    “…A Non-dominated sorting (NS) approach from Non-dominated Sorting Genetic Algorithm II (NSGAII) is adopted into SDA to develop its multi-objective (MO) type algorithm. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  12. 12

    Evaluation of dynamic programming among the existing stereo matching algorithms by Teo, Chee Huat, Nurulfajar, Abd Manap

    Published 2015
    “…On this research is to perform an evaluation on the performance between the dynamic programming with other existing method as comparison. The algorithm used on the dynamic programming is the global optimization which provides better process on stereo images like its accuracy and its computational efficiency compared to other existing stereo matching algorithms. …”
    Get full text
    Get full text
    Get full text
    Article
  13. 13
  14. 14

    New algorithm for gyroless spacecraft angular rate Estimation and its application by Abdelrahman, Mohammad, Samaan, Malak A.

    Published 2006
    “…A new algorithm for estimating the angular velocity using quaternion measurements is developed based on the concept of the global optimality resulting when using a centralized or master Kalman filter. …”
    Get full text
    Get full text
    Article
  15. 15

    Simulated Kalman Filter algorithms for solving optimization problems by Nor Hidayati, Abdul Aziz

    Published 2019
    “…The Wilcoxon signed ranked statistical test shows that the ssSKF algorithm that uses an adaptive local neighbourhood in the prediction phase performs statistically better than the SKF algorithm that uses the last estimated state as its prediction, especially in solving high dimensional functions. …”
    Get full text
    Get full text
    Thesis
  16. 16
  17. 17
  18. 18

    Improved Salp Swarm Algorithm based on opposition based learning and novel local search algorithm for feature selection by Tubishat, Mohammad, Idris, Norisma, Shuib, Liyana, Abushariah, Mohammad A.M., Mirjalili, Seyedali

    Published 2020
    “…The second improvement includes the development and use of new Local Search Algorithm with SSA to improve its exploitation. …”
    Get full text
    Get full text
    Article
  19. 19
  20. 20