Search Results - (( a practical function 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
  10. 10

    Enhancing speed performance of the cryptographic algorithm based on the lucas sequence by M. Abulkhirat, Esam

    Published 2003
    “…Reducing the calculation time of the algorithm, in sequential and parallel platforms, using the doubling-rule technique combined with a new scheme led to a strong improvement of the LUC algorithm speed. …”
    Get full text
    Get full text
    Thesis
  11. 11

    Real time nonlinear filtered-x lms algorithm for active noise control by Sahib, Mouayad Abdulredha

    Published 2012
    “…The NLFXLMS algorithm is a stochastic gradient algorithm that incorporates the derivative of a nonlinear plant model which is represented by the scaled error function (SEF) in the controller design. …”
    Get full text
    Get full text
    Thesis
  12. 12

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

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

    A Novel Discrete Filled Function Algorithm in Solving Discrete Optimization Problems (S/O: 12408) by Woon, Siew Fang, Karim, Sharmila, Mohamad, Mohd Saiful Adli

    Published 2016
    “…At the initial stage, an auxiliary function is introduced in discrete filled function method which turns the local minimizer of the original function to be a local maximizer. …”
    Get full text
    Get full text
    Monograph
  15. 15

    Enhancing harmony search parameters based on step and linear function for bus driver scheduling and rostering problems by Mansor, Nur Farraliza

    Published 2018
    “…Optimization is a major challenge in numerous practical world problems.According to the “No Free Lunch (NFL)” theorem,there is no existing single optimizer algorithm that is able to resolve all issues in an effective and efficient manner.It is varied and need to be solved according to the specific capabilities inherent to certain algorithms making it hard to foresee the algorithm that is best suited for each problem.As a result,the heuristic technique is adopted for this research as it has been identified as a potentially suitable algorithm.Alternative heuristic algorithms are also suggested to obtain optimal solutions with reasonable computational effort.However,the heuristic approach failed to produce a solution that nears optimum when the complexity of a problem increases;therefore a type of nature-inspired algorithm known as meta-euristics which utilises an intelligent searching mechanism over a population is considered and consequently used.The meta-heuristic approach is widely used to substitute heuristic terms and is broadly applied to address problems with regards to driver scheduling.However,this meta-heuristic technique is still unable to address the fairness issue in the scheduling and rostering problems.Hence,this research proposes a strategy to adopt an amendment of the harmony search algorithm in order to address the fairness issue which in turn will escalate the level of fairness in driver scheduling and rostering.The harmony search algorithm is classified as a meta-heuristics algorithm that is capable of solving hard and combinatorial or discrete optimisation problems.In this respect,the three main operators in harmony search,namely the Harmony Memory Consideration Rate (HMCR),Pitch Adjustment Rate (PAR) and Bandwidth (BW) play a vital role in balancing local exploitation and global exploration.These parameters influence the overall performance of the HS algorithm,and therefore it is crucial to fine-tune them. …”
    Get full text
    Get full text
    Get full text
    Thesis
  16. 16

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

    A modified generalized RBF model with EM-based learning algorithm for medical applications by Ma, Li Ya, Abdul Rahman, Abdul Wahab, Quek, Chai

    Published 2006
    “…In this paper, we propose a generalized RBF (GRBF) model to reduce the number of basis functions and thus alleviate curse of dimensionality. …”
    Get full text
    Get full text
    Get full text
    Proceeding Paper
  18. 18

    An optimized wavelet neural networks using cuckoo search algorithm for function approximation and chaotic time series prediction by Pauline Ong, Pauline Ong, Zainuddin, Zarita

    Published 2023
    “…Although the practicability of using wavelet neural networks (WNNs) in nonlinear function approximation has been addressed extensively, selecting the optimal number of hidden nodes and their appropriate initial locations remains a great challenge for WNNs’ initialization. …”
    Get full text
    Get full text
    Get full text
    Article
  19. 19

    An optimized wavelet neural networks using cuckoo search algorithm for function approximation and chaotic time series prediction by Pauline Ong, Pauline Ong, Zainuddin, Zarita

    Published 2023
    “…Although the practicability of using wavelet neural networks (WNNs) in nonlinear function approximation has been addressed extensively, selecting the optimal number of hidden nodes and their appropriate initial locations remains a great challenge for WNNs’ initialization. …”
    Get full text
    Get full text
    Get full text
    Article
  20. 20

    An optimized wavelet neural networks using cuckoo search algorithm for function approximation and chaotic time series prediction by Pauline Ong, Pauline Ong, Zainuddin, Zarita

    Published 2023
    “…Although the practicability of using wavelet neural networks (WNNs) in nonlinear function approximation has been addressed extensively, selecting the optimal number of hidden nodes and their appropriate initial locations remains a great challenge for WNNs’ initialization. …”
    Get full text
    Get full text
    Get full text
    Article