Search Results - (( java segmentation using algorithm ) OR ( using solving first 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
    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:
  5. 5
    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:
  6. 6
    Two-point block backward differentiation formula for solving higher order ordinary differential equations

    Two-point block backward differentiation formula for solving higher order ordinary differential equations by Zainuddin, Nooraini

    Published 2011
    “…The algorithms are written in C language and the numerical results of these methods are compared to that of reducing it to a system of first order ODEs and solves using the first order ODEs method. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  7. 7
    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
    “…Here, firstly, two experimental tests have been carried out to show the validity and consistency of the applied algorithms for solving TTRPSDTW. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  8. 8
    Enhanced algorithms for three-dimensional object interpreter

    Enhanced algorithms for three-dimensional object interpreter by Haron, Habibollah

    Published 2004
    “…In the first phase, two algorithms were proposed. The first is enhanced thinning algorithm that is used to thin the sketch while maintaining its topology and basic shape. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  9. 9
    A fuzzy genetic algorithm based on binary encoding for solving multidimensional knapsack problems

    A fuzzy genetic algorithm based on binary encoding for solving multidimensional knapsack problems by Varnamkhasti, Mohammad Jalali, Lee, Lai Soon

    Published 2012
    “…Computational experiments are conducted on the proposed techniques and the results are compared with other genetic operators, heuristics, and local search algorithms commonly used for solving multidimensional 0/1 knapsack problems published in the literature.…”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  10. 10
    Performance Analyses of Nature-inspired Algorithms on the Traveling Salesman’s Problems for Strategic Management

    Performance Analyses of Nature-inspired Algorithms on the Traveling Salesman’s Problems for Strategic Management by Julius, Beneoluchi Odili, M. N. M., Kahar, Noraziah, Ahmad, M., Zarina, Riaz, Ul Haq

    Published 2017
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  11. 11
    Hybrid multiobjective genetic algorithm for integrated dynamic scheduling and routing of jobs and automated guided vehicles in flexible manufacturing systems

    Hybrid multiobjective genetic algorithm for integrated dynamic scheduling and routing of jobs and automated guided vehicles in flexible manufacturing systems by Umar, Umar Ali

    Published 2014
    “…First scenario uses static consideration, the second scenario uses dynamic consideration with machine failure recovery. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  12. 12
    Block backward differentiation formulas for solving first and second order fuzzy differential equations

    Block backward differentiation formulas for solving first and second order fuzzy differential equations by Tiaw, Kah Fook

    Published 2016
    “…The first part of the thesis discussed the combination of BBDF and Block Simpson into Hybrid method for solving first order FDEs. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  13. 13
    Heuristic algorithm for university final examination timetabling

    Heuristic algorithm for university final examination timetabling by Thian, Tze Yung

    Published 2015
    “…In the, first part, the grouping of courses is simplified using the lecture timetable which acts as a stepping stone, for solving constraints. …”
    Get full text
    Get full text
    Final Year Project Report / IMRAD
    Save to List
    Saved in:
  14. 14
    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:
  15. 15
    Ant colony optimization in dynamic environments

    Ant colony optimization in dynamic environments by Chen, Fei Huang

    Published 2010
    “…This thesis is an investigation into the application ' of ACO for solving dynamic optimization problems. The first objective of this study is to identify which ant algorithm performs the best under a dynamic environment. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  16. 16
    Formulating new enhanced pattern classification algorithms based on ACO-SVM

    Formulating new enhanced pattern classification algorithms based on ACO-SVM by Alwan, Hiba Basim, Ku-Mahamud, Ku Ruhana

    Published 2013
    “…This paper presents two algorithms that integrate new Ant Colony Optimization (ACO) variants which are Incremental Continuous Ant Colony Optimization (IACOR) and Incremental Mixed Variable Ant Colony Optimization (IACOMV) with Support Vector Machine (SVM) to enhance the performance of SVM.The first algorithm aims to solve SVM model selection problem. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  17. 17
    Parallel method using MPI for solving large systems of delay differential equations

    Parallel method using MPI for solving large systems of delay differential equations by Ishak, Fuziyah, Suleiman, Mohamed

    Published 2012
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  18. 18
    Solving the integrated inventory supply chain problems using meta-heuristic methods / Seyed Mohsen Mousavi

    Solving the integrated inventory supply chain problems using meta-heuristic methods / Seyed Mohsen Mousavi by Seyed Mohsen , Mousavi

    Published 2018
    “…A Modified Particle Swarm Optimization (MPSO) algorithm, a Genetic Algorithm (GA), a modified fruit fly optimization algorithm (MFOA) and a simulated annealing (SA) algorithm were used to find the optimal solution. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  19. 19
    Feedforward neural network for solving particular fractional differential equations

    Feedforward neural network for solving particular fractional differential equations by Admon, Mohd Rashid

    Published 2024
    “…This study also focuses on solving fractal-fractional differential equations in the Caputo sense with a power-law kernel (FFDEsCP) using FNN in two hidden layers with a vectorized algorithm alongside Adam (FNN2HLVA-Adam). …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  20. 20
    A modified flower pollination algorithm and carnivorous plant algorithm for solving engineering optimization problem

    A modified flower pollination algorithm and carnivorous plant algorithm for solving engineering optimization problem by Ong, Kok Meng

    Published 2021
    “…Their convergence characteristic and computational efficiency were analysed and compared with eight widely used metaheuristic algorithms, with the superiority validated using the Wilcoxon signed-rank test. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:

Search Tools: