Search Results - (( a ((simulation using) OR (solution using)) algorithm ) OR ( java based optimization algorithm ))

Search alternatives:

Refine Results
  1. 1
    Ant colony optimization algorithm for load balancing in grid computing

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

    Published 2012
    “…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 other ant based algorithm, in terms of resource utilization. …”
    Get full text
    Get full text
    Get full text
    Monograph
    Save to List
    Saved in:
  2. 2
    Enhancement of Ant Colony Optimization for Grid Job Scheduling and Load Balancing

    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
    Save to List
    Saved in:
  3. 3
    Resource management in grid computing using ant colony optimization

    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
    Save to List
    Saved in:
  4. 4
    Attribute reduction based scheduling algorithm with enhanced hybrid genetic algorithm and particle swarm optimization for optimal device selection

    Attribute reduction based scheduling algorithm with enhanced hybrid genetic algorithm and particle swarm optimization for optimal device selection by Nwogbaga, Nweso Emmanuel, Latip, Rohaya, Affendey, Lilly Suriani, Abdul Rahiman, Amir Rizaan

    Published 2022
    “…Therefore, in this paper, we proposed Dynamic tasks scheduling algorithm based on attribute reduction with an enhanced hybrid Genetic Algorithm and Particle Swarm Optimization for optimal device selection. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  5. 5
    Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization

    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
    Save to List
    Saved in:
  6. 6
    SG-PBFS : Shortest Gap-Priority Based Fair Scheduling technique for job scheduling in cloud environment

    SG-PBFS : Shortest Gap-Priority Based Fair Scheduling technique for job scheduling in cloud environment by Murad, Saydul Akbar, Zafril Rizal, M. Azmi, Muzahid, Abu Jafar Md, Bhuiyan, Md Khairul Bashar, Saib, Md, Rahimi, Nick, Prottasha, Nusrat Jahan, Bairagi, Anupam Kumar

    Published 2024
    “…Firstly, a Priority-Based Fair Scheduling (PBFS) algorithm has been introduced to schedule jobs so that jobs can access the required resources at optimal times. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  7. 7
    Digital Quran With Storage Optimization Through Duplication Handling And Compressed Sparse Matrix Method

    Digital Quran With Storage Optimization Through Duplication Handling And Compressed Sparse Matrix Method by Ashraf Saleh Mohammad Alomoush

    Published 2024
    thesis::doctoral thesis
    Save to List
    Saved in:
  8. 8
    Handling Words Duplication and Memory Management for Digital Quran Based on Hexadecimal Representation and Sparse Matrix

    Handling Words Duplication and Memory Management for Digital Quran Based on Hexadecimal Representation and Sparse Matrix by Ashraf Al-Omoush, Norita Md Norwawi, Ahmad Akmalludin Mazlan

    Published 2024
    Article
    Save to List
    Saved in:
  9. 9
    Optimization of blood vessel detection in retina images using multithreading and native code for portable devices

    Optimization of blood vessel detection in retina images using multithreading and native code for portable devices by Tran, Duc Ngoc, Hussin, Fawnizu Azmadi, Yusoff, Mohd Zuki

    Published 2013
    “…The optimization of a computationally intensive algorithm such as this on a mobile platform is challenging due to the limited resources available. …”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  10. 10
    Automatic Number Plate Recognition on android platform: With some Java code excerpts

    Automatic Number Plate Recognition on android platform: With some Java code excerpts by ., Abdul Mutholib, Gunawan, Teddy Surya, Kartiwi, Mira

    Published 2016
    “…Hence, the objective of this research is to propose suitable and optimize algorithm for ANPR system on Android mobile phone. …”
    Get full text
    Get full text
    Get full text
    Book
    Save to List
    Saved in:
  11. 11
    Simulated Kalman Filter algorithms for solving optimization problems

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

    Published 2019
    “…In principle, the optimization problem is regarded as a state estimation process. Each agent acts as a Kalman filter and finds solution to the optimization problem using a standard Kalman Filter framework which comprises of prediction, simulated measurement, and estimation phase that uses the best-so-far solution as a reference. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  12. 12
    Development of heuristic methods based on genetic algorithm (GA) for solving vehicle routing problem

    Development of heuristic methods based on genetic algorithm (GA) for solving vehicle routing problem by Ismail, Zuhaimy, Nurhadi, Irhamah, Zainuddin, Zaitul Marlizawati

    Published 2008
    “…Genetic Algorithm gives a pool of solutions rather than just one. …”
    Get full text
    Get full text
    Monograph
    Save to List
    Saved in:
  13. 13
    Single-Solution Simulated Kalman Filter Algorithm for Global Optimisation Problems

    Single-Solution Simulated Kalman Filter Algorithm for Global Optimisation Problems by Nor Hidayati, Abdul Aziz, Zuwairie, Ibrahim, Nor Azlina, Ab. Aziz, Mohd Saberi, Mohamad, Watada, Junzo

    Published 2016
    “…This paper introduces single-solution Simulated Kalman Filter (ssSKF), a new single-agent optimisa- tion algorithm inspired by Kalman Filter, for solving real-valued numerical optimisation problems. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  14. 14
    Smart student timetable planner

    Smart student timetable planner by Wong, Xin Tong

    Published 2025
    “…Course data is managed in CSV format, parsed into JSON for fast processing, while sessionStorage and localStorage handle user data within active sessions. A Genetic Algorithm forms the core scheduling engine, generating optimized timetables that respect both hard constraints, such as avoiding clashes, and soft constraints, such as personal preferences.The final output of this project is a functional web-based timetable planner that successfully enhances scheduling efficiency, reduces the likelihood of errors, and improves the overall academic planning experience. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
    Save to List
    Saved in:
  15. 15
    A multiobjective simulated Kalman filter optimization algorithm

    A multiobjective simulated Kalman filter optimization algorithm by A. Azwan, A. Razak, Mohd Falfazli, Mat Jusof, Ahmad Nor Kasruddin, Nasir, Mohd Ashraf, Ahmad

    Published 2018
    “…It is a further enhancement of a single-objective Simulated Kalman Filter (SKF) optimization algorithm. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  16. 16
    Single-solution Simulated Kalman Filter algorithm for global optimisation problems

    Single-solution Simulated Kalman Filter algorithm for global optimisation problems by Abdul Aziz, N.H., Ibrahim, Z., Ab Aziz, N.A., Mohamad, M.S., Watada, J.

    Published 2018
    “…This paper introduces single-solution Simulated Kalman Filter (ssSKF), a new single-agent optimisation algorithm inspired by Kalman Filter, for solving real-valued numerical optimisation problems. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  17. 17
    Single-solution Simulated Kalman Filter algorithm for global optimisation problems

    Single-solution Simulated Kalman Filter algorithm for global optimisation problems by Abdul Aziz, N.H., Ibrahim, Z., Ab Aziz, N.A., Mohamad, M.S., Watada, J.

    Published 2018
    “…This paper introduces single-solution Simulated Kalman Filter (ssSKF), a new single-agent optimisation algorithm inspired by Kalman Filter, for solving real-valued numerical optimisation problems. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  18. 18
    Simulated kalman filter algorithm with improved accuracy

    Simulated kalman filter algorithm with improved accuracy by Mohd Falfazli, Mat Jusof, Ahmad Azwan, Abdul Razak, Shuhairie, Mohammad, Ahmad Nor Kasruddin, Nasir, Mohd Helmi, Suid, Mohd Ashraf, Ahmad, Zuwairie, Ibrahim

    Published 2018
    “…This paper presents an improved Simulated Kalman Filter optimiza-tion algorithm. It is a further enhancement of a Simulated Kalman Filter (SKF) optimization algorithm. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Book Chapter
    Save to List
    Saved in:
  19. 19
    Simulated annealing algorithm for solving chambering student-case assignment problem

    Simulated annealing algorithm for solving chambering student-case assignment problem by Ghazali, Saadiah, Abdul Rahman, Syariza

    Published 2015
    “…The challenge of solving the problem raise whenever the complexity related to preferences, the existence of real-world constraints and problem size increased.This study focuses on solving a chambering student-case assignment problem by using a simulated annealing algorithm where this problem is classified under project assignment problem.The project assignment problem is considered as hard combinatorial optimization problem and solving it using a metaheuristic approach is an advantage because it could return a good solution in a reasonable time. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  20. 20
    Simulated kalman filter with modified measurement, substitution mutation and hamming distance calculation for solving traveling salesman problem

    Simulated kalman filter with modified measurement, substitution mutation and hamming distance calculation for solving traveling salesman problem by Suhazri Amrin, Rahmad, Zuwairie, Ibrahim, Zulkifli, Md. Yusof

    Published 2022
    “…Purpose – The purpose of the research is to solve Travelling Salesman Problem (TSP) using Simulated Kalman Filter (SKF) algorithm and single-solution SKF (ssSKF) algorithm based on numerical ordering technique. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:

Search Tools: