Search Results - (( problem set generation algorithm ) OR ( java simulation optimization algorithm ))

Search alternatives:

Refine Results
  1. 1
    Features selection for intrusion detection system using hybridize PSO-SVM

    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
    Save to List
    Saved in:
  2. 2
    APPROXIMATION ALGORITHM-BASED INITIAL POPULATION GENERATION FOR THE GENETIC ALGORITHM SOLUTION OF THE SET COVERING PROBLEM

    APPROXIMATION ALGORITHM-BASED INITIAL POPULATION GENERATION FOR THE GENETIC ALGORITHM SOLUTION OF THE SET COVERING PROBLEM by MOHAMAD RAZIP, HAJAR

    Published 2019
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  3. 3
    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
    “…The simulation is implemented with iFogSim and java programming language. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  4. 4
    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:
  5. 5
    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
    “…The proposed algorithm is known as the enhance ant colony optimization (EACO). …”
    Get full text
    Get full text
    Get full text
    Monograph
    Save to List
    Saved in:
  6. 6
    Genetic algortihm to solve pcb component placement modeled as travelling salesman problem

    Genetic algortihm to solve pcb component placement modeled as travelling salesman problem by Mohd Khazzarul Khazreen, Mohd Zaidi

    Published 2013
    “…To achieve this result, genetic algorithm technique was used. There are several objectives set for this research which all of them connected to the title itself which is about genetic algorithm as an alternative to solve PCB component modeled as TSP problem. …”
    Get full text
    Get full text
    Undergraduates Project Papers
    Save to List
    Saved in:
  7. 7
    OPTIMIZED MIN-MIN TASK SCHEDULING ALGORITHM FOR SCIENTIFIC WORKFLOWS IN A CLOUD ENVIRONMENT

    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
    Save to List
    Saved in:
  8. 8
    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
    “…The computational complexity of most vehicle routing problem and moreover the intricate of stochastic VRP algorithm has made them an important candidate for solution using metaheuristics. …”
    Get full text
    Get full text
    Monograph
    Save to List
    Saved in:
  9. 9
    New Learning Models for Generating Classification Rules Based on Rough Set Approach

    New Learning Models for Generating Classification Rules Based on Rough Set Approach by Al Shalabi, Luai Abdel Lateef

    Published 2000
    “…Recently, different models were used to generate knowledge from vague and uncertain data sets such as induction decision tree, neural network, fuzzy logic, genetic algorithm, rough set theory, and others. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  10. 10
    Faculty timetabling using genetic algorithm

    Faculty timetabling using genetic algorithm by Liong, Boon Yaun

    Published 2011
    “…Faculty Timetabling using Genetic Algorithm (FTGA) is an application that generate optimum timetable for faculty.The target user of this application is faculty staff who responsible in generate timetable.The problem statement of the project is many clashing exist in the timetable.Faculty staff needs to solve the clashing manually.This will waste time and it is a problem for staff to solve the clashing.By implement GA,clashing will be reduced.The objective of the project is to develop aprototype in scheduling application for generates an optimum timetable for a faculty.Genetic algorithm will be implemented.The scope of FTGA is Faculty of Computer Systems & Software Engineering (FCSSE).The methodology use in this project is prototype model.The testing result show 95 out of 100 test cases achieved the maximum fitness value which means there is no clashing in the timetable.The maximum generation is set to 15 generation.Population for each generation is 3 populations.Percentage of FTGA solve the problem is 95%.…”
    Get full text
    Get full text
    Undergraduates Project Papers
    Save to List
    Saved in:
  11. 11
    Procedures of generating a true clean data in simple mediation analysis

    Procedures of generating a true clean data in simple mediation analysis by Fitrianto, Anwar, Midi, Habshah

    Published 2011
    “…By incorporating ModDRGP in the proposed algorithm has rectified the problem of having high leverage points in the generated clean data set, especially for mediation models. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  12. 12
    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:
  13. 13
    Genetic algorithms for urban transit routing problems

    Genetic algorithms for urban transit routing problems by Chew, Joanne Suk Chun

    Published 2012
    “…Metaheuristic algorithm is suitable for the di±culties of this problem. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  14. 14
    Comparison between starter sets generation method for listing all permutations

    Comparison between starter sets generation method for listing all permutations by Karim, Sharmila, Ibrahim, Haslinda, Omar, Zurni

    Published 2013
    “…distinct permutations is an exhaustive process.Using starter set, the process of listing the permutations becomes easy.However a problem arises when the equivalence starter sets will generate the similar permutation and needed to be discarded.Two new recursive strategies are proposed to generate starter sets without generating equivalence starter sets namely circular and exchange two elements operation.Once the starter sets are obtained, the circular and reverse of circular operation are employed to produce distinct permutation from each starter sets.Computational advantages are presented comparing the results obtained by the new method with two other existing methods.The result indicates that the exchange two elements based strategy is faster than the circular based.Overall all new algorithms are better than existing algorithms in time execution.…”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  15. 15
    Application of intelligence based genetic algorithm for job sequencing problem on parallel mixed-model assembly line

    Application of intelligence based genetic algorithm for job sequencing problem on parallel mixed-model assembly line by Noroziroshan, Alireza, Mohd Ariffin, Mohd Khairol Anuar, Ismail, Napsiah

    Published 2010
    “…In order to check the capability of proposed algorithm, several experimentations on the set of problems were done. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  16. 16
    Elitism Based Migrating Birds Optimization Algorithm for Optimization Testing

    Elitism Based Migrating Birds Optimization Algorithm for Optimization Testing by Hasneeza, L. Zakaria, Kamal Z., Zamli

    Published 2017
    “…In this paper, we combined MBO and elitism to solve the Combinatorial Interaction Testing (CIT) problem i.e. to find a set of minimum test case which is an NP-Complete problem. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  17. 17
    Effect of parameters variation on the performance of particle swarm optimization algorithm for tag coverage problem of radio frequency identification network

    Effect of parameters variation on the performance of particle swarm optimization algorithm for tag coverage problem of radio frequency identification network by Nawawi, Azli, Hasnan, Khalid, Ngali, Zamani, Sidek, Noor Azizah

    Published 2016
    “…Next, sets of comparison were made. From the experiment, the best set of results is generated when the swarm size is set at 200 and the iteration number is at 50. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  18. 18
    New recursive circular algorithm for listing all permutations

    New recursive circular algorithm for listing all permutations by Karim, Sharmila, Omar, Zurni, Ibrahim, Haslinda, Othman, Khairil Iskandar, Suleiman, Mohamed

    Published 2014
    “…Once the starter sets are obtained, the circular and reverse of circular operations are easily employed to produce distinct permutations from each starter set.However, a problem arises when the equivalence starter sets generate similar permutations and, therefore, will need to be discarded. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  19. 19
    A hybrid local search algorithm for minimum dominating set problems

    A hybrid local search algorithm for minimum dominating set problems by Abed, S.A., Rais, H.M., Watada, J., Sabar, N.R.

    Published 2022
    “…To solve these problems, we propose a two-stage hybrid local search algorithm. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  20. 20
    A hybrid local search algorithm for minimum dominating set problems

    A hybrid local search algorithm for minimum dominating set problems by Abed, S.A., Rais, H.M., Watada, J., Sabar, N.R.

    Published 2022
    “…To solve these problems, we propose a two-stage hybrid local search algorithm. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:

Search Tools: