Search Results - (( developing group commitment algorithm ) OR ( java implementation matching algorithm ))

  • Showing 1 - 5 results of 5
Refine Results
  1. 1

    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
  2. 2

    A modified shuffled frog leaping algorithm and its application to short-term hydrothermal scheduling / Mohamad Khairul Hakimi Abdul Hady by Abdul Hady, Mohamad Khairul Hakimi

    Published 2016
    “…This thesis discusses the solution of short-term hydrothermal scheduling problem using modified shuffled frog-leaping algorithm, which is inspired by the behavior of a group frog to find a place that has the most food optimization technique purpose that has been develop for solving the hydrothermal scheduling problem. …”
    Get full text
    Get full text
    Thesis
  3. 3

    Multi-floor indoor location estimation system based on wireless local area network by Chua, Tien Han

    Published 2007
    “…During location estimation, current histogram of RSS at unknown location will be compared to the database. The most probable match is selected and returned as estimated location based on Bayesian filtering algorithm. …”
    Get full text
    Get full text
    Thesis
  4. 4

    An Agent-Based System with Personalization and Intelligent Assistance Services for Facilitating Knowledge Sharing by Mohd Sharef, Nurfadhlina

    Published 2006
    “…KSFaci is embedded in web environment and is implemented using Java Servlet and runs under Apache server. …”
    Get full text
    Get full text
    Thesis
  5. 5

    Skyline queries on data with uncertain dimensions for efficient computation by Mohd Saad, Nurul Husna

    Published 2018
    “…The performance of SkyQUD-T is studied against two naïve algorithms that are developed to reflect the best-case and worst-case scenarios. …”
    Get full text
    Get full text
    Thesis