Search Results - (( java segmentation using algorithm ) OR ( using solving _ algorithm ))

Search alternatives:

Refine Results
  1. 1
    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:
  2. 2
    Automatic Number Plate Recognition on android platform: With some Java code excerpts

    Automatic Number Plate Recognition on android platform: With some Java code excerpts by ., Abdul Mutholib, Gunawan, Teddy Surya, Kartiwi, Mira

    Published 2016
    “…On the other hand, the traditional algorithm using template matching only obtained 83.65% recognition rate with 0.97 second processing time. …”
    Get full text
    Get full text
    Get full text
    Book
    Save to List
    Saved in:
  3. 3
    Development of seven segment display recognition using TensorFlow on Raspberry Pi

    Development of seven segment display recognition using TensorFlow on Raspberry Pi by Gunawan, Teddy Surya, Mohammad Reduwan, Haque, Yaacob, Mashkuri, Mohamed Azmin, Nor Fadhillah, Ismail, Nanang, Ismail, Md Yusof, Kartiwi, Mira, A. Rahman, Azhar

    Published 2022
    Get full text
    Get full text
    Get full text
    Get full text
    Proceeding Paper
    Save to List
    Saved in:
  4. 4
    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:
  5. 5
    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
    “…This project will focusing on the method used to solve an optimization problem, the limitation of the method used and the results of solving flow shop sequencing problem using genetic algorithm method. …”
    Get full text
    Get full text
    Undergraduates Project Papers
    Save to List
    Saved in:
  6. 6
    Gravitational search – bat algorithm for solving single and bi-objective of non-linear functions

    Gravitational search – bat algorithm for solving single and bi-objective of non-linear functions by Abbas, Iraq Tareq

    Published 2018
    “…The second technique is to solve bi-objective functions by using the BOBAT algorithm. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  7. 7
    Simulated Kalman Filter algorithms for solving optimization problems

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

    Published 2019
    “…The algorithms are evaluated using 30 benchmark functions of the CEC2014 benchmark suite, and then applied to solve PCB drill path optimization case study. …”
    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 and explores the potential of using Genetic Algorithm to solve Transcendental Equation. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  9. 9
    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
    “…The results obtained are competitive to previous HS variants that used to solve Knapsack problem.…”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  10. 10
    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
    “…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:
  11. 11
    An enhanced swap sequence-based particle swarm optimization algorithm to solve TSP

    An enhanced swap sequence-based particle swarm optimization algorithm to solve TSP by Bibi Aamirah Shafaa Emambocus, Muhammed Basheer Jasser, Muzaffar Hamzah, Aida Mustapha, Angela Amphawan

    Published 2021
    “…The Traveling Salesman Problem (TSP) is a combinatorial optimization problem that is useful in a number of applications. Since there is no known polynomial-time algorithm for solving large scale TSP, metaheuristic algorithms such as Ant Colony Optimization (ACO), Bee Colony Optimization (BCO), and Particle Swarm Optimization (PSO) have been widely used to solve TSP problems through their high quality solutions. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  12. 12
    Design and Implementation of a Robot for Maze-Solving using Flood-Fill Algorithm

    Design and Implementation of a Robot for Maze-Solving using Flood-Fill Algorithm by Elshamarka, Ibrahim, Saman, Abu Bakar Sayuti

    Published 2012
    “…This paper describes an implementation of a maze-solving robot designed to solve a maze based on the flood-fill algorithm. …”
    Get full text
    Get full text
    Get full text
    Citation Index Journal
    Save to List
    Saved in:
  13. 13
    Sudoku Generator based on hybrid algorithm / Faridah Abdul Rahman

    Sudoku Generator based on hybrid algorithm / Faridah Abdul Rahman by Abdul Rahman, Faridah

    Published 2012
    “…Sudoku Generator is a prototype that automatically generates and solves the Sudoku. Before this, Sudoku generator has been develop using backtracking algorithm only, but this research use two algorithm which is recursive and backtracking algorithm that called as hybrid algorithm. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  14. 14
    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
    “…These new parallel and sequential finite difference time domain (FDTD) algorithms yield from O(h2), ordinary O(h4) and weighted average O(h4) centered difference discretization using direct-domain and temporary-domain are used to solve problems mentioned above. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  15. 15
    Comparative study of methods for solving the Rubik’s Cube / Nur Syahirah Shuhaimi & Noor Fazlini Mustari

    Comparative study of methods for solving the Rubik’s Cube / Nur Syahirah Shuhaimi & Noor Fazlini Mustari by Shuhaimi, Nur Syahirah, Mustari, Noor Fazlini

    Published 2019
    “…Solving Rubik’s cube can be using software or layer-by-layer human method. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  16. 16
    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
    “…Therefore, for solving the SMA algorithm local optima problem, we used the Levy distribution rather than the conventional uniform distribution in the candidate selection procedure. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  17. 17
    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
    “…Purpose – The purpose of the research is to solve Travelling Salesman Problem (TSP) using Simulated Kalman Filter (SKF) algorithm and single-solution SKF (ssSKF) algorithm based on numerical ordering technique. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  18. 18
    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:
  19. 19
    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
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  20. 20
    Formulating and solving stochastic truck and trailer routing problems using meta-heuristic algorithms / Seyedmehdi Mirmohammadsadeghi

    Formulating and solving stochastic truck and trailer routing problems using meta-heuristic algorithms / Seyedmehdi Mirmohammadsadeghi by Seyedmehdi, Mirmohammadsadeghi

    Published 2015
    “…The results indicate that the applied algorithms can generate the useful results. Therefore, iv MA, M-SA and TS are found suitable for solving TTRPSDTW as well. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:

Search Tools: