Search Results - (( developing solving problems algorithm ) OR ( java optimization search algorithm ))

Search alternatives:

Refine Results
  1. 1
    Comparison of performances of Jaya Algorithm and Cuckoo Search algorithm using benchmark functions

    Comparison of performances of Jaya Algorithm and Cuckoo Search algorithm using benchmark functions by Ahmed, Mashuk, Nasser, Abdullah B., Kamal Z., Zamli, Heripracoyo, Sulistyo

    Published 2022
    “…Metaheuristic algorithms have been used successfully for solving different optimization problems. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  2. 2
    A random search based effective algorithm for pairwise test data generation

    A random search based effective algorithm for pairwise test data generation by Sabira, Khatun, K. F., Rabbi, Che Yahaya, Yaakub, Klaib, Mohammad F. J.

    Published 2011
    “…This paper proposes an effective random search based pairwise test data generation algorithm named R2Way to optimize the number of test cases. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  3. 3
    Bats echolocation-inspired algorithms for global optimisation problems

    Bats echolocation-inspired algorithms for global optimisation problems by Nafrizuan, Mat Yahya

    Published 2016
    “…The works related to swarm intelligence algorithms include the development of the algorithm itself, its modification and improvisation as well as its application in solving global optimisation problems. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  4. 4
    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:
  5. 5
    Approximate maximum clique algorithm (AMCA): A clever technique for solving the maximum clique problem through near optimal algorithm for minimum vertex cover problem

    Approximate maximum clique algorithm (AMCA): A clever technique for solving the maximum clique problem through near optimal algorithm for minimum vertex cover problem by Fayaz, Muhammad, Arshad,, Shakeel, Shah,, Abdul Salam, Shah, Asadullah

    Published 2018
    “…Background and Objective: The process of solving the Maximum Clique (MC) problem through approximation algorithms is harder, however, the Maximum Vertex Cover (MVC) problem can easily be solved using approximation algorithms. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  6. 6
    CSC126 - Fundamentals of Algorithms and Computer Problem Solving / Faculty of Computer And Mathematical Sciences

    CSC126 - Fundamentals of Algorithms and Computer Problem Solving / Faculty of Computer And Mathematical Sciences by UiTM, Faculty of Computer And Mathematical Sciences

    Published 2023
    “…In the end they are expected to develop the ability to analyze simple problems, organize effective algorithmic solutions for the problems and write computer programs to solve them.…”
    Get full text
    Get full text
    Get full text
    Teaching Resource
    Save to List
    Saved in:
  7. 7
    An ensemble learning method for spam email detection system based on metaheuristic algorithms

    An ensemble learning method for spam email detection system based on metaheuristic algorithms by Behjat, Amir Rajabi

    Published 2015
    “…In order to address the challenges that mentioned above in this study, in the first phase, a novel architecture based on ensemble feature selection techniques include Modified Binary Bat Algorithm (NBBA), Binary Quantum Particle Swarm Optimization (QBPSO) Algorithm and Binary Quantum Gravita tional Search Algorithm (QBGSA) is hybridized with the Multi-layer Perceptron (MLP) classifier in order to select relevant feature subsets and improve classification accuracy. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  8. 8
    Solving transcendental equation using genetic algorithm / Masitah Hambari

    Solving transcendental equation using genetic algorithm / Masitah Hambari by Masitah , Hambari

    Published 2004
    “…This project studies the potential of using Genetic Algorithm and develops a program in order to solve Transcendental Equation in optimizing problem domain. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  9. 9
    Shuffled frog leaping algorithm for solving economic load dispatch problem / Mohammad Ariffin Aizat Ezanee

    Shuffled frog leaping algorithm for solving economic load dispatch problem / Mohammad Ariffin Aizat Ezanee by Ezanee, Mohammad Ariffin Aizat

    Published 2015
    “…Shuffled Frog Leaping Algorithm (SFLA) is proposed to solve Economic Load Dispatch (ELD) problem. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  10. 10
    Simulated Kalman Filter algorithms for solving optimization problems

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

    Published 2019
    “…Applications and improvements to the HKA algorithm suggest that optimization algorithm based on estimation principle has a huge potential in solving a wide variety of optimization problems. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  11. 11
    Optimize class time tabling by using genetic algorithm technique in UTHM

    Optimize class time tabling by using genetic algorithm technique in UTHM by Ahmad, Izah Rafidah

    Published 2019
    “…This research used genetic algorithm (GA) that was applied to java programming languages with a goal of reducing conflict and optimizing the fitness. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  12. 12
    Application of ant colony optimisation algorithms in solving facility layout problems formulated as quadratic assignment problems: a review

    Application of ant colony optimisation algorithms in solving facility layout problems formulated as quadratic assignment problems: a review by See, Phen Chiak, Wong, Kuan Yew

    Published 2008
    “…This paper is aimed to provide a comprehensive review of the concepts of ACO and its application in solving QAPs. In addition, the various ACO algorithms or variants developed to solve them are critically analysed and discussed. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  13. 13
    Genetic-local hybrid optimizer for solving advance layout problem

    Genetic-local hybrid optimizer for solving advance layout problem by Taha, Imad, Ibrahim Habra, Hind Saleem

    Published 2006
    “…Results show the potentiality of the proposed algorithm in solving the problem and outperforming previous algorithms.…”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  14. 14
    CSC118: Fundamentals of Algorithm Development / College of Computing, Informatics and Media

    CSC118: Fundamentals of Algorithm Development / College of Computing, Informatics and Media by UiTM, College of Computing, Informatics and Media

    Published 2023
    “…This course will focus on algorithm development in problem solving. It will also introduce the students to the techniques of problem solving using modular approach. …”
    Get full text
    Get full text
    Get full text
    Teaching Resource
    Save to List
    Saved in:
  15. 15
    A discrete simulated kalman filter optimizer for combinatorial optimization problems

    A discrete simulated kalman filter optimizer for combinatorial optimization problems by Suhazri Amrin, Rahmad

    Published 2022
    “…In the last few decades, significant research effort has been spent on the development of numerical algorithms, particularly for solving combinatorial problems. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  16. 16
    Review on bio-inspired algorithms approach to solve assembly line balancing problem

    Review on bio-inspired algorithms approach to solve assembly line balancing problem by Noorazliza, Sulaiman, Junita, Mohamad Saleh, Nor Rokiah Hanum, Md. Haron, Z. A., Kamaruzzaman

    Published 2019
    “…Bio-inspired algorithms that have been developed by mimicking the biological phenomenon of nature have been widely applied to solve many real-world problems. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  17. 17
    Fast Finite Difference Time Domain Algorithms for Solving Antenna Application Problem

    Fast Finite Difference Time Domain Algorithms for Solving Antenna Application Problem by Hasan, Mohammad Khatim

    Published 2008
    “…Existing method, known as FDTD needs a very long processing time to solve this problem. The objective of the thesis is to develop new sequential and parallel algorithms that are faster than the standard Finite Difference Time Domain method. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  18. 18
    Solving single machine scheduling problem with maximum lateness using a genetic algorithm

    Solving single machine scheduling problem with maximum lateness using a genetic algorithm by Nazif, Habibeh, Lee, Lai Soon

    Published 2010
    “…We develop an optimised crossover operator designed by an undirected bipartite graph within a genetic algorithm for solving a single machine family scheduling problem, where jobs are partitioned into families and setup time is required between these families. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  19. 19
    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:
  20. 20
    Levy slime mould algorithm for solving numerical and engineering optimization problems

    Levy slime mould algorithm for solving numerical and engineering optimization problems by J. J., Jui, M. A., Ahmad, M. I. M., Rashid

    Published 2022
    “…The proposed Levy Slime Mould Algorithm (LSMA) is a novel metaheuristic algorithm that integrates the Levy distribution into a new metaheuristic called Slime Mould Algorithm (SMA) for solving numerical and engineering problems. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:

Search Tools: