Search Results - (( java application tree algorithm ) OR ( programming program whether algorithm ))
Search alternatives:
- programming program »
- java application »
- application tree »
- tree algorithm »
-
1
-
2
Development of DNA fragment assembly using idury-waterman algorithm / Nurul Azyanny Mustaffa
Published 2013“…It is to shows whether the program implemented satisfied the Idury-Waterman algorithm or not. …”
Get full text
Get full text
Student Project -
3
Self-similar network traffic using Random Midpoint Displacement (RMD) algorithm / Jumaliah Saarini
Published 2006“…The way to solve this problem, we applied the existed method in visual C++ programming with used the Random midpoint Displacement (RMD) algorithm. …”
Get full text
Get full text
Student Project -
4
Development of dynamic programming algorithm for maintenance scheduling problem
Published 2020“…Using the dynamic programming algorithm developed, the model was also able to recalculate alternative schedules by replacing unavailable teams with other teams to avoid delays. …”
Get full text
Get full text
Thesis -
5
A review of slicing techniques in software engineering
Published 2015“…Quite a large numbers of variants for the program slicing have been analyzed along with the algorithms to compute the slice. …”
Get full text
Get full text
Get full text
Proceeding Paper -
6
Study and Implementation of Data Mining in Urban Gardening
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 -
7
-
8
-
9
Classification System for Heart Disease Using Bayesian Classifier
Published 2007“…This system was developing base on to three main part which is data processing, testing and implementation of the algorithm. In this system a Bayesian algorithm was used in order to implement the system. …”
Get full text
Get full text
Thesis -
10
Mining Sequential Patterns using I-PrefixSpan
Published 2008Get full text
Get full text
Citation Index Journal -
11
Adoption of machine learning algorithm for analysing supporters and non supporters feedback on political posts / 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 -
12
Data mining in network traffic using fuzzy clustering
Published 2003“…The fuzzy clustering process are made using three algorithms : Fuzzy C-Means (FCM), Gustafsof-Kessel (GK) and Gath-Geva (GG) algorithm. …”
Get full text
Get full text
Thesis -
13
Data mining in network traffic using fuzzy clustering
Published 2003“…The fuzzy clustering process are made using three algorithms : Fuzzy C-Means (FCM), Gustafsof-Kessel (GK) and Gath-Geva (GG) algorithm. …”
Get full text
Get full text
Thesis -
14
-
15
Machine learning predictions of stock market pattern using Econophysics approach
Published 2025“…In conclusion, the study of Econophysics principles with Python programming and machine learning algorithms has indicates that the predictive framework is reliable and effective in capturing stock price fluctuations, enhancing decision-making for investors based on data-driven insights.…”
Get full text
Get full text
Book Section -
16
Moving detection using cellular neural network (CNN)
Published 2008“…This analysis indicates whether the object has shifted position or moved in the images. …”
Get full text
Get full text
Undergraduates Project Papers -
17
Mining Sequential Patterns Using I-PrefixSpan
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 -
18
Minimizing makespan of a resource-constrained scheduling problem: a hybrid greedy and genetic algorithms
Published 2015“…In this article, an effective backward-forward search method (BFSM) is proposed using Greedy algorithm that is employed as a part of a hybrid with a two-stage genetic algorithm (BFSM-GA). …”
Get full text
Get full text
Get full text
Article -
19
-
20
