Search Results - (( developing solving _ algorithm ) OR ( java application tree algorithm ))

Search alternatives:

Refine Results
  1. 1
    Separator Database and SPM Tree Framework for Mining Sequential Patterns Using Prefixspan with Pseudoprojection

    Separator Database and SPM Tree Framework for Mining Sequential Patterns Using Prefixspan with Pseudoprojection by Saputra , Dhany, Rambli, Dayang R.A., Foong, Oi Mean

    Published 2008
    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
    “…Using the J48 tree algorithm implemented through WEKA API on a Java Servlet, data provided is processed to derive a health index of the plant, with the possible outcomes set to “Good,” “Okay”, or “Bad”. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  3. 3
    Mining Sequential Patterns using I-PrefixSpan

    Mining Sequential Patterns using I-PrefixSpan by Saputra , Dhany, Dayang R.A. Rambli, Foong, Oi Mean

    Published 2008
    Get full text
    Get full text
    Citation Index Journal
    Save to List
    Saved in:
  4. 4
    Adoption of machine learning algorithm for analysing supporters and non supporters feedback on political posts / Ogunfolajin Maruff Tunde

    Adoption of machine learning algorithm for analysing supporters and non supporters feedback on political posts / Ogunfolajin Maruff Tunde by Ogunfolajin Maruff , Tunde

    Published 2022
    “…This thesis is based on the application of sentiment classification algorithm to tweet data with the goal of classifying messages based on the polarity of sentiment towards a particular topic (or subject matter). …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  5. 5
    Bats echolocation-inspired algorithms for global optimisation problems

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

    Published 2016
    “…The works related to swarm intelligence algorithms include the development of the algorithm itself, its modification and improvisation as well as its application in solving global optimisation problems. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  6. 6
    Sudoku Generator based on hybrid algorithm / Faridah Abdul Rahman

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

    Published 2012
    “…The hybrid algorithm is applied in prototype development where in process on solving Sudoku. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  7. 7
    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:
  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 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:
  9. 9
    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:
  10. 10
    Mining Sequential Patterns Using I-PrefixSpan

    Mining Sequential Patterns Using I-PrefixSpan by Dhany , Saputra, Rambli Dayang, R.A., Foong, Oi Mean

    Published 2007
    “…In this paper, we propose an improvement of pattern growth-based PrefixSpan algorithm, called I-PrefixSpan. The general idea of I-PrefixSpan is to use the efficient data structure for general tree-like framework and separator database to reduce the execution time and memory usage. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    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
    “…Its optimality has inspired the development of a metaheuristic algorithm called Heuristic Kalman Algorithm (HKA) in 2009. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  12. 12
    New Generalized Algorithm for Developing k-Step Higher Derivative Block Methods for Solving Higher Order Ordinary Differential Equations

    New Generalized Algorithm for Developing k-Step Higher Derivative Block Methods for Solving Higher Order Ordinary Differential Equations by Adeyeye, Oluwaseun, Omar, Zurni

    Published 2018
    “…This article presents a new generalized algorithm for developing k-step (m+1) derivative block methods for solving mth order ordinary differential equations. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  13. 13
    Mathematical models and optimization algorithms for low-carbon Location-Inventory-Routing Problem with uncertainty

    Mathematical models and optimization algorithms for low-carbon Location-Inventory-Routing Problem with uncertainty by Liu, Lihua

    Published 2024
    “…Given the NP-Hard nature of the three models proposed in this thesis, two metaheuristic algorithms have been developed. A hybrid Particle Swarm Optimization-Bacterial Foraging Algorithm is developed for solving the single objective LIRP model. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  14. 14
    Comparison Between Genetic Algorithm and Electromagnetism-Like Algorithm for Solving Inverse Kinematics

    Comparison Between Genetic Algorithm and Electromagnetism-Like Algorithm for Solving Inverse Kinematics by Yap, David F. W.

    Published 2012
    “…A comparison study between Electromagnetism-Like Algorithm (EM) and Genetic Algorithm (GA)has been presented in this work to solve the Inverse Kinematics (IK) of a four-link planar robot manipulator. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  15. 15
    Development of cell formation algorithm and model for cellular manufacturing system

    Development of cell formation algorithm and model for cellular manufacturing system by Nouri, Hossein

    Published 2011
    “…In addition, one of the main challenges has been development of efficient algorithm for solving aforementioned model to find exact feasible optimal solution. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  16. 16
    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
    “…Existing method, known as FDTD needs a very long processing time to solve this problem. The objective of the thesis is to develop new sequential and parallel algorithms that are faster than the standard Finite Difference Time Domain method. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  17. 17
    Shuffled frog leaping algorithm for solving economic load dispatch problem / Mohammad Ariffin Aizat Ezanee

    Shuffled frog leaping algorithm for solving economic load dispatch problem / Mohammad Ariffin Aizat Ezanee by Ezanee, Mohammad Ariffin Aizat

    Published 2015
    “…Shuffled Frog Leaping Algorithm (SFLA) is proposed to solve Economic Load Dispatch (ELD) problem. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  18. 18
    AI powered asthma prediction towards treatment formulation: an android app approach

    AI powered asthma prediction towards treatment formulation: an android app approach by Murad, Saydul Akbar, Adhikary, Apurba, Md Muzahid, Abu Jafar, Sarker, Md Murad Hossain, Khan, Md. Ashikur Rahman, Hossain, Md. Bipul, Bairagi, Anupam Kumar, Masud, Mehedi, Kowsher, Md

    Published 2022
    “…We utilized eight robust machine learning algorithms to analyze this dataset. We found that the Decision tree classifier had the best performance, out of the eight algorithms, with an accuracy of 87%. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  19. 19
    CSC118: Fundamentals of Algorithm Development / College of Computing, Informatics and Media

    CSC118: Fundamentals of Algorithm Development / College of Computing, Informatics and Media by UiTM, College of Computing, Informatics and Media

    Published 2023
    “…This course will focus on algorithm development in problem solving. It will also introduce the students to the techniques of problem solving using modular approach. …”
    Get full text
    Get full text
    Get full text
    Teaching Resource
    Save to List
    Saved in:
  20. 20
    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
    “…We develop an optimised crossover operator designed by an undirected bipartite graph within a genetic algorithm for solving a single machine family scheduling problem, where jobs are partitioned into families and setup time is required between these families. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:

Search Tools: