Search Results - (( java implementation _ algorithm ) OR ( problem solving problems algorithm ))

Search alternatives:

Refine Results
  1. 1
    Parallel distributed genetic algorithm development based on microcontrollers framework

    Parallel distributed genetic algorithm development based on microcontrollers framework by Krishnan P.S., Kiong T.S., Koh J.

    Published 2023
    “…Genetic algorithms are powerful optimizing techniques that are used successfully to solve problems in many different disciplines. …”
    Conference paper
    Save to List
    Saved in:
  2. 2
    Plagiarism Detection System for Java Programming Assignments by Using Greedy String-Tilling Algorithm

    Plagiarism Detection System for Java Programming Assignments by Using Greedy String-Tilling Algorithm by Norulazmi, Kasim

    Published 2008
    “…The prototype system, known as Java Plagiarism Detection System (JPDS) implements the Greedy-String-Tiling algorithm to detect similarities among tokens in a Java source code files. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  3. 3
    Improving Class Timetabling using Genetic Algorithm

    Improving Class Timetabling using Genetic Algorithm by Qutishat, Ahmed Mohammed Ali

    Published 2006
    “…Hence, the major aim of this research is to investigate the internal mechanism of genetic algorithm in solving and improving class timetabling problem. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  4. 4
    Fuzzy modeling using Bat Algorithm optimization for classification

    Fuzzy modeling using Bat Algorithm optimization for classification by Noor Amidah, Ahmad Sultan

    Published 2018
    “…In order to solve it, Bat Algorithm method is implement in to optimization method in fuzzy modeling for classification. …”
    Get full text
    Get full text
    Get full text
    Undergraduates Project Papers
    Save to List
    Saved in:
  5. 5
    Optimal route checking using genetic algorithm for UiTM's bus services / Tengku Salman Fathi Tengku Jaafar

    Optimal route checking using genetic algorithm for UiTM's bus services / Tengku Salman Fathi Tengku Jaafar by Tengku Jaafar, Tengku Salman Fathi

    Published 2006
    “…By taking the bus services in Universiti Teknologi MARA as sample, the research has used the genetic algorithm approach to solve the problem which is similar to the Travel Salesman Problem. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  6. 6
    Image clustering comparison of two color segmentation techniques

    Image clustering comparison of two color segmentation techniques by Subramaniam, Kavitha Pichaiyan

    Published 2010
    “…Finally, the algorithm found, which would solve the image segmentation problem.…”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  7. 7
    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
    “…Therefore, engineers are turning to optimization methods as a complementary alternative strategy of exhaustive searching. 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:
  8. 8
    Batch mode heuristic approaches for efficient task scheduling in grid computing system

    Batch mode heuristic approaches for efficient task scheduling in grid computing system by Maipan-Uku, Jamilu Yahaya

    Published 2016
    “…Many algorithms have been implemented to solve the grid scheduling problem. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  9. 9
    Data Hiding Techniques In Digital Images

    Data Hiding Techniques In Digital Images by Al Thloothi, Salah Ramadan

    Published 2003
    “…After all these studies, one of the algorithms in the masking technique is developed and implemented using JAVA program to embed message into true color image with a good quality and higher capacity. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  10. 10
    Application of genetic algorithm methods to optimize flowshop sequencing problem

    Application of genetic algorithm methods to optimize flowshop sequencing problem by Mohd Fadil, Md Sairi

    Published 2008
    “…At the end of this project, we can see the performance of genetic algorithm method in solving flow shop sequencing problem and types of flow shop sequencing problems that can be solve through genetic algorithm method. …”
    Get full text
    Get full text
    Undergraduates Project Papers
    Save to List
    Saved in:
  11. 11
    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:
  12. 12
    Bats echolocation-inspired algorithms for global optimisation problems

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

    Published 2016
    “…An adaptive bats sonar algorithm is proposed for solving single objective optimisation problems. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  13. 13
    Iterative methods for solving split common fixed point problems in Hilbert spaces

    Iterative methods for solving split common fixed point problems in Hilbert spaces by Mohammed, Lawan Bulama

    Published 2016
    “…Our interest here is to apply these mappings to propose some algorithms for solving split common fixed point problems and its variant forms, in the end, we prove the convergence results of these algorithms. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  14. 14
    Application of adaptive bats sonar algorithm for solving a single objective of practical business optimisation problem PROBLEM

    Application of adaptive bats sonar algorithm for solving a single objective of practical business optimisation problem PROBLEM by Nafrizuan, Mat Yahya, M. Nafis, O. Z.

    Published 2016
    “…An adaptive bats sonar algorithm to solve single objective optimisation problem is presented. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    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
    “…Due to the practical significance of this problem in real-world issues, numerous algorithms have been proposed to solve it. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  16. 16
    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
    “…Solving knapsack problem consider NP hard problem and many previous research tried to find optimal solution for it. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  17. 17
    Generic DNA encoding design scheme to solve combinatorial problems

    Generic DNA encoding design scheme to solve combinatorial problems by Rofilde, Hasudungan

    Published 2015
    “…The complexity of combinatorial problems is classified as NP meaning that algorithms are yet to exist to efficiently solve the problem. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  18. 18
    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:
  19. 19
    Simulated annealing algorithm for solving chambering student-case assignment problem

    Simulated annealing algorithm for solving chambering student-case assignment problem by Ghazali, Saadiah, Abdul Rahman, Syariza

    Published 2015
    “…The challenge of solving the problem raise whenever the complexity related to preferences, the existence of real-world constraints and problem size increased.This study focuses on solving a chambering student-case assignment problem by using a simulated annealing algorithm where this problem is classified under project assignment problem.The project assignment problem is considered as hard combinatorial optimization problem and solving it using a metaheuristic approach is an advantage because it could return a good solution in a reasonable time. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  20. 20
    Simulated kalman filter with modified measurement, substitution mutation and hamming distance calculation for solving traveling salesman problem

    Simulated kalman filter with modified measurement, substitution mutation and hamming distance calculation for solving traveling salesman problem by Suhazri Amrin, Rahmad, Zuwairie, Ibrahim, Zulkifli, Md. Yusof

    Published 2022
    “…Findings – The results of the SKF algorithm and the ssSKF algorithm will be evaluated to decide which algorithm is better at solving this type of problem. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:

Search Tools: