Search Results - (( java application optimisation algorithm ) OR ( using a problem algorithm ))

Search alternatives:

Refine Results
  1. 1
    Web-based expert system for material selection of natural fiber- reinforced polymer composites

    Web-based expert system for material selection of natural fiber- reinforced polymer composites by Ahmed Ali, Basheer Ahmed

    Published 2015
    “…Secondly, an expert system using Java programming technology with two tiers of search engine was developed to perform a fast selection of candidate materials in huge volume. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  2. 2
    Study and Implementation of Data Mining in Urban Gardening

    Study and Implementation of Data Mining in Urban Gardening by Mohana, Muniandy, Lee, Eu Vern

    Published 2019
    “…The system is essentially a three-part development, utilising Android, Java Servlets, and Arduino platforms to create an optimised and automated urban-gardening system. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  3. 3
    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
    “…The proposed method provides a platform to efficiently solve the MC problem by using approximation algorithm of Minimum Vertex Cover (MVC).…”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  4. 4
    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
    “…Two types of analysis are used to evaluate the proposed algorithm. First, the DSKFO algorithm is used to solve the travelling salesman problem (TSP), and then the algorithm's execution time is measured. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  5. 5
    Enhancement of Ant System Algorithm for Course Timetabling Problem

    Enhancement of Ant System Algorithm for Course Timetabling Problem by Djamarus, Djasli

    Published 2009
    “…As a member of the NP Problem, an exact algorithm to solve the course scheduling problem is not available to date. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  6. 6
    Solving 0/1 Knapsack Problem Using Hybrid HS and Jaya Algorithms

    Solving 0/1 Knapsack Problem Using Hybrid HS and Jaya Algorithms by Alomoush, Alaa A., Alsewari, Abdulrahman A., Alamri, Hammoudeh S., Kamal Z., Zamli

    Published 2018
    “…In this research, a new hybrid algorithm of Harmony search and Jaya search algorithms applied on 0/1 Knapsack problem to find a near optimal results. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  7. 7
    Comparison between ant colony and genetic algorithm using traveling salesman problem

    Comparison between ant colony and genetic algorithm using traveling salesman problem by Abduljabbar, Zaid Ammen, Khalefa, Mustafa S., A. Jabar, Marzanah

    Published 2013
    “…The aim of this study is compare the effect of using two distributed algorithm which are ant colony as a Swarm intelligence algorithm and genetic algorithm. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  8. 8
    A Micro-Genetic Algorithm Approach for Soft Constraint Satisfaction Problem in University Course Scheduling

    A Micro-Genetic Algorithm Approach for Soft Constraint Satisfaction Problem in University Course Scheduling by Abd. Halim, Bohadean @ Bohari

    Published 2013
    “…This problem can be minimized by using a Micro Genetic Algorithm approach. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  9. 9
    Optimization and discretization of dragonfly algorithm for solving continuous and discrete optimization problems

    Optimization and discretization of dragonfly algorithm for solving continuous and discrete optimization problems by Bibi Amirah Shafaa, Emambocus

    Published 2024
    “…Furthermore, the original DA is only suitable for solving continuous optimization problems. Although there is a binary version of the algorithm, it cannot be directly used for solving discrete optimization problems like the Traveling Salesman Problem (TSP). …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  10. 10
    A new cryptographic algorithm based on decomposition problem in elliptic curve cryptography / Hilyati Hanina Zazali

    A new cryptographic algorithm based on decomposition problem in elliptic curve cryptography / Hilyati Hanina Zazali by Hilyati Hanina, Zazali

    Published 2012
    “…This approach presents better platform in finite field E as compared to the original works using the braid groups. The second algorithm deals with the use of Decomposition Problem in encryption scheme for ECC. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    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
    “…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:
  12. 12
    Bats echolocation-inspired algorithms for global optimisation problems

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

    Published 2016
    “…The algorithm is a hybrid algorithm that operates using dual level search strategy that takes merits of a particle swarm optimisation algorithm and a modified adaptive bats sonar algorithm. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  13. 13
    Using Metaheuristics Algorithms (MHAs) to Optimize Water Supply Operation in Reservoirs: a Review

    Using Metaheuristics Algorithms (MHAs) to Optimize Water Supply Operation in Reservoirs: a Review by Almubaidin M.A.A., Ahmed A.N., Sidek L.B.M., Elshafie A.

    Published 2023
    Review
    Save to List
    Saved in:
  14. 14
    Bees algorithm for Forest transportation planning optimization in Malaysia

    Bees algorithm for Forest transportation planning optimization in Malaysia by Jamaluddin, Jamhuri, Kamarudin, Norizah, Ismail, Mohd Hasmadi, Ahmad, Siti Azfanizam

    Published 2021
    “…Algorithm is widely used in various areas due to its ability to solve classes of problems. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  15. 15
    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:
  16. 16
    A novel solution to traveling salesman problem using fuzzy sets, gravitational search algorithm, and genetic algorithm

    A novel solution to traveling salesman problem using fuzzy sets, gravitational search algorithm, and genetic algorithm by Abarghouei, Amir Atapour

    Published 2010
    “…TSP is a representative of a large class of problems known as the combinatorial optimization problems. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  17. 17
    Intergrated multi-objective optimisation of assembly sequence planning and assembly line balancing using particle swarm optimisation

    Intergrated multi-objective optimisation of assembly sequence planning and assembly line balancing using particle swarm optimisation by M. F. F., Ab Rashid

    Published 2013
    “…The MODPSO algorithm is tested with a wide range of problem difficulties for integrated single-model and mixed-model ASP and ALB problems. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  18. 18
    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:
  19. 19
    Recent Evolutionary Algorithm Variants for Combinatorial Optimization Problem

    Recent Evolutionary Algorithm Variants for Combinatorial Optimization Problem by Anniza, Hamdan, San Nah, Sze, Say Leng, Goh, Kang Leng, Chiew, Wei King, Tiong

    Published 2023
    “…The evolutionary algorithm has been extensively used to solve a range of combinatorial optimization problems. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  20. 20
    Improved Multicrossover Genetic Algorithm For Twodimensional Rectangular Bin Packing Problem

    Improved Multicrossover Genetic Algorithm For Twodimensional Rectangular Bin Packing Problem by Sarabian, Maryam

    Published 2010
    “…Initial computational experiments are conducted independently on the named components using some benchmark problem instances. The most competitive techniques from each component are combined to form a new algorithm called Improved MXGA (MXGAi). …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:

Search Tools: