Search Results - (( knowledge function a algorithm ) OR ( java simulation optimization algorithm ))

Refine Results
  1. 1
  2. 2

    Enhancement of Ant Colony Optimization for Grid Job Scheduling and Load Balancing by Husna, Jamal Abdul Nasir

    Published 2011
    “…Global pheromone update is performed after the completion of processing the jobs in order to reduce the pheromone value of resources. A simulation environment was developed using Java programming to test the performance of the proposed EACO algorithm against existing grid resource management algorithms such as Antz algorithm, Particle Swarm Optimization algorithm, Space Shared algorithm and Time Shared algorithm, in terms of processing time and resource utilization. …”
    Get full text
    Get full text
    Get full text
    Thesis
  3. 3

    Ant colony optimization algorithm for load balancing in grid computing by Ku-Mahamud, Ku Ruhana, Mohamed Din, Aniza

    Published 2012
    “…The proposed algorithm is known as the enhance ant colony optimization (EACO). …”
    Get full text
    Get full text
    Get full text
    Monograph
  4. 4

    OPTIMIZED MIN-MIN TASK SCHEDULING ALGORITHM FOR SCIENTIFIC WORKFLOWS IN A CLOUD ENVIRONMENT by Murad S.S., Badeel R., Alsandi N.S.A., Alshaaya R.F., Ahmed R.A., Muhammed A., Derahman M.

    Published 2023
    “…To achieve this, we propose a new noble mechanism called Optimized Min-Min (OMin-Min) algorithm, inspired by the Min-Min algorithm. …”
    Review
  5. 5

    Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization by Mohammad Ata, Karimeh Ibrahim

    Published 2019
    “…This study proposes a car parking management system which applies Dijkstra’s algorithm, Ant Colony Optimization (ACO) and Binary Search Tree (BST) in structuring a guidance system for indoor parking. …”
    Get full text
    Get full text
    Thesis
  6. 6

    Features selection for intrusion detection system using hybridize PSO-SVM by Tabaan, Alaa Abdulrahman

    Published 2016
    “…Hybridize Particle Swarm Optimization (PSO) as a searching algorithm and support vector machine (SVM) as a classifier had been implemented to cope with this problem. …”
    Get full text
    Get full text
    Thesis
  7. 7

    Resource management in grid computing using ant colony optimization by Ku-Mahamud, Ku Ruhana, Mohamed Din, Aniza

    Published 2011
    “…Resources with high pheromone value are selected to process the submitted jobs.Global pheromone update is performed after completion processing the jobs in order to reduce the pheromone value of resources.A simulation environment was developed using Java programming to test the performance of the proposed EACO algorithm against other ant based algorithm, in terms of resource utilization.Experimental results show that EACO produced better grid resource management solution.…”
    Get full text
    Get full text
    Get full text
    Get full text
    Monograph
  8. 8

    Implementation of locust inspired scheduling algorithm with huge number of servers for energy efficiency in a cloud datacenter by Azhar, Nur Huwaina

    Published 2019
    “…Cloudsim is used as Discrete Event Simulation tool and Java as coding language to evaluate LACE algorithm. …”
    Get full text
    Get full text
    Thesis
  9. 9

    Reliability fuzzy clustering algorithm for wellness of elderly people by N. J., Mohd Jamal, Ku Muhammad Naim, Ku Khalif, Mohd Sham, Mohamad

    Published 2019
    “…This proposed algorithm could support to improve the overall health of CKD patients through a variety of indicators such as physical functioning, mental health, vitality, and social functioning. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  10. 10
  11. 11

    Biological-based semi-supervised clustering algorithm to improve gene function prediction by Kasim, Shahreen, Deris, Safaai, M. Othman, Razib, Hashim, Rathiah

    Published 2011
    “…However, commonclustering algorithms do not provide a comprehensive approach that look into the three categories of annotations; biologicalprocess, molecular function, and cellular component, and were not tested with different functional annotation database formats.Furthermore, the traditional clustering algorithms use random initialization which causes inconsistent cluster generation and areunable to determine the number of clusters involved. …”
    Get full text
    Get full text
    Article
  12. 12

    SecPath: Energy efficient path reconstruction in wireless sensor network using iterative smoothing by Abd, Wamidh Jwdat

    Published 2019
    “…To achieve energy efficiency, it compresses the packet information by using GZIP tools in JAVA. SecPath is evaluated with several variations using 400 nodes in WSN deployments as well as large-scale simulations. …”
    Get full text
    Get full text
    Thesis
  13. 13
  14. 14

    Semi-supervised learning for feature selection and classification of data / Ganesh Krishnasamy by Ganesh , Krishnasamy

    Published 2019
    “…An efficient iterative algorithm is developed to optimize the objective function of the proposed algorithm since it is non-smooth and difficult to solve. …”
    Get full text
    Get full text
    Get full text
    Thesis
  15. 15

    The implementation of z-numbers in fuzzy clustering algorithm for wellness of chronic kidney disease patients by N. J., Mohd Jamal, Ku Muhammad Naim, Ku Khalif, Mohd Sham, Mohamad

    Published 2019
    “…A case study of the CKD patients with the selected indicators is considered to demonstrate the capability of z-numbers to handle the knowledge of human being and uncertain information and also will present the idea in developing a robust and reliable fuzzy clustering algorithm particularly in dealing with knowledge of human being using z-numbers.…”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  16. 16

    Multiview Laplacian semisupervised feature selection by leveraging shared knowledge among multiple tasks by Krishnasamy, Ganesh, Paramesran, Raveendran

    Published 2019
    “…Our proposed algorithm is capable of exploiting complementary information from different feature views in each task while exploring the shared knowledge between multiple related tasks in a joint framework when the labeled training data is sparse. …”
    Get full text
    Get full text
    Article
  17. 17

    Energy efficient path reconstruction in wireless sensor network using iPath by Hasan, Sazlinah, Abd, Wamidh Jwdat, Ariffin, Ahmad Alauddin

    Published 2019
    “…To achieve energy efficiency, it compresses the packet information by using GZIP tools in JAVA. Energy efficient iPath (E-iPath) is evaluated with several variations of nodes in WSN deployments as well as large-scale simulations. …”
    Get full text
    Get full text
    Get full text
    Article
  18. 18

    The impact of population size on knowledge acquisition in genetic algorithms paradigm: Finding solutions in the game of Sudoku by Abu Bakar, Nordin, Mahadzir, Muhammad Fadhil

    Published 2010
    “…Population size is an important component in genetic algorithms (GAs).The concept of population in GAs has contributed to a unique searching strategy which empower its search process through the massive volume of the data in a population.The purpose of this study is to see how the impact of population size on genetic algorithms in producing correct solution for a Sudoku puzzle.Sudoku is a Japanese number puzzle game that has become a worldwide phenomenon.The puzzle involves completing a grid of cells by assigning a single number to each cell.The numbers in a row or a column must consist of any one of the numbers from 1 to 9; no repetition is allowed.GA will be used to generate the correct solution of Sudoku puzzles.The mechanism to produce legal Sudoku grid will follow the requirements needed and meet all the constraints.A fitness function is designed to evaluate legal grids and GA will be tested for performance and time efficiency.The challenges lie on how GA will represent a Sudoku grid in the process and the effectiveness of its operators such as crossover and mutation.The results show how different population size can produce different solutions.The best performance is observed at 500 population size.The paper will conclude with an insight of this value and its significance to the knowledge acquisition in GA paradigm..…”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  19. 19

    Ant colony system with heuristic function for the travelling salesman problem by Alobaedy, Mustafa Muwafak, Ku-Mahamud, Ku Ruhana

    Published 2013
    “…Ant colony system which is classified as a meta-heuristic algorithm is considered as one of the best optimization algorithm for solving different type of NP-Hard problem including the travelling salesman problem.A heuristic function in the Ant colony system uses pheromone and distance values to produce heuristic values in solving the travelling salesman problem.However, the heuristic values are not updated in the entire process to reflect the knowledge discovered by ants while moving from city to city. …”
    Get full text
    Get full text
    Get full text
    Article
  20. 20

    A shift column different offset for better Rijndael security by Mahmod, Ramlan, Ali, Sherif Abdulbari, Abd Ghani, Abdul Azim

    Published 2009
    “…This paper proposes a transformation function to be added to the Rijndael algorithm. …”
    Get full text
    Get full text
    Get full text
    Article