Search Results - (( knowledge solution search algorithm ) OR ( java simulation optimization algorithm ))

Refine Results
  1. 1

    Overview of metaheuristic: classification of population and trajectory by Zainul Rashid, Zarina

    Published 2010
    “…Some algorithms can be defined if the developer of the system has problem specific knowledge to the solution. …”
    Get full text
    Get full text
    Monograph
  2. 2
  3. 3

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

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

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

    Algorithm in the fluidized-bed reactor for the polymerization of propylene by Zanil, Mohd Fauzi, Chan, K.O., Hussain, Mohd Azlan

    Published 2019
    “…The proposed algorithm is designed by improving the exploration knowledge of onlooker bee from meta-heuristic concept in search space. …”
    Get full text
    Get full text
    Article
  7. 7
  8. 8

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

    Process Planning Optimization In Reconfigurable Manufacturing Systems by Musharavati, Farayi

    Published 2008
    “…The five (5) AADTs include; a variant of the simulated annealing algorithm that implements heuristic knowledge at critical decision points, two (2) cooperative search schemes based on a “loose hybridization” of the Boltzmann Machine algorithm with (i) simulated annealing, and (ii) genetic algorithm search techniques, and two (2) modified genetic algorithms. …”
    Get full text
    Get full text
    Thesis
  10. 10

    Manufacturing process planning optimisation in reconfigurable multiple parts flow lines by Ismail, Napsiah, Musharavati, Farayi, Hamouda, Abdel Magid Salem, Ramli, Abdul Rahman

    Published 2008
    “…Design/methodology/approach: The genetic algorithm methodology implements a genetic algorithm that is augmented by application specific heuristics in order to guide the search for an optimal solution. …”
    Get full text
    Get full text
    Get full text
    Article
  11. 11

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

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

    Hyper-heuristic approaches for data stream-based iIntrusion detection in the Internet of Things by Hadi, Ahmed Adnan

    Published 2022
    “…In addition, it is considered that existing solutions do not provide a feature driftaware solution to the concept drift adaptable solution, which exploits the fact that many of the original features are non-relevant. …”
    Get full text
    Get full text
    Thesis
  14. 14

    Tasks Distribution In Driver Scheduling Using Dynamic Set Of Bandwidth In Harmony Search Algorithm With 2-Opt by Shaffiei, Zatul Alwani

    Published 2021
    “…Knowledge on the problem is needed to assist the searching process and to strengthen the exploitation. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  15. 15

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

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

    An Evolutionary Algorithm: An Enhancement of Binary Tournament Selection for Fish Feed Formulation by Soong, Cai Juan, Abd Rahman, Rosshairy, Ramli, Razamin, Abd Manaf, Mohammed Suhaimee, Chek-Choon, Ting

    Published 2022
    “…*e novelty of the proposed SD tournament selection is compared with BT selection in terms of searching for an efficient but not myopic algorithm. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  18. 18

    Long-term electrical energy consumption: Formulating and forecasting via optimized gene expression programming / Seyed Hamidreza Aghay Kaboli by Seyed Hamidreza , Aghay Kaboli

    Published 2018
    “…In the developed feature selection approach, multi-objective binary-valued backtracking search algorithm (MOBBSA) is used as an efficient evolutionary search algorithm to search within different combinations of input variables and selects the non-dominated feature subsets, which minimize simultaneously both the estimation error and the number of features. …”
    Get full text
    Get full text
    Get full text
    Thesis
  19. 19
  20. 20

    Hybrid metaheuristics for QOS-aware service composition / Hadi Naghavipour by Hadi , Naghavipour

    Published 2022
    “…On that basis, the second contribution of this thesis is proposing a fast fuzzy evolutionary algorithm with minimal stochastic behaviour. Furthermore, this thesis contributes to the body of knowledge by introducing a novel method called Fuzzy Rough set Genetic Algorithm (FRGA) that take on efficiency of metaheuristics while reducing search space by leveraging the data mining aspect of rough set theory. …”
    Get full text
    Get full text
    Get full text
    Thesis