Search Results - (( develop computing new algorithm ) OR ( java application tree algorithm ))
Search alternatives:
- develop computing »
- java application »
- application tree »
- tree algorithm »
- computing new »
- new algorithm »
-
1
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 -
2
-
3
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 -
4
Extended development of a Computer Aided Detection (CAD) system for brain bleed in CT / Muhammad Illyas Abdul Muhji
Published 2018“…In this study, 227 volumes of brain CT images were used to develop and validate the CAD. The new develop algorithm is set to register image of brain patient in order to determine the rotation angle for brain realignment. …”
Get full text
Get full text
Thesis -
5
Development of Algorithm for QoS Model in Cloud Computing
Published 2021Get full text
Get full text
Get full text
Article -
6
Augmentation of basic-line-search and quick-simplex-method algorithms to enhance linear programming computational performance
Published 2021“…The thesis was set to three objectives as follows; to develop a new augmentation algorithm of Simplex method from the existed augmentation studies; to integrate the superiorities of the QSM and BLSA algorithms that can enhance computational performance; to compare the performance of the new augmentation algorithm with the conventional Simplex, QSM and BLSA in reducing iteration number. …”
Get full text
Get full text
Get full text
Thesis -
7
DESIGN AND EVALUATION OF RESOURCE ALLOCATION AND JOB SCHEDULING ALGORITHMS ON COMPUTATIONAL GRIDS
Published 2012“…The issue is not only to develop new algorithms, but also to evaluate them on an experimental computational grid, using synthetic and real workload traces, along with the other existing job scheduling algorithms. …”
Get full text
Get full text
Thesis -
8
-
9
Mining Sequential Patterns using I-PrefixSpan
Published 2008Get full text
Get full text
Citation Index Journal -
10
-
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
A new algorithm for system of integral equations
Published 2014“…We develop a new algorithm to solve the system of integral equations. …”
Get full text
Get full text
Get full text
Article -
13
Multi-base number representation in application to scalar multiplication and pairing computation
Published 2011“…Multi-bases number representation is used to construct new versions of Miller’s algorithm. These algorithms are formulated for computing Tate and ate pairing. …”
Get full text
Get full text
Thesis -
14
Ant colony optimization algorithm for dynamic scheduling of jobs in computational grid
Published 2012“…Job scheduling problem is classified as an NP-hard problem.Such a problem can be solved only by using approximate algorithms such as heuristic and meta-heuristic algorithms.Among different optimization algorithms for job scheduling, ant colony system algorithm is a popular meta-heuristic algorithm which has the ability to solve different types of NP-hard problems.However, ant colony system algorithm has a deficiency in its heuristic function which affects the algorithm behavior in terms of finding the shortest connection between edges.This research focuses on a new heuristic function where information about recent ants’ discoveries has been considered.The new heuristic function has been integrated into the classical ant colony system algorithm.Furthermore, the enhanced algorithm has been implemented to solve the travelling salesman problem as well as in scheduling of jobs in computational grid.A simulator with dynamic environment feature to mimic real life application has been development to validate the proposed enhanced ant colony system algorithm. …”
Get full text
Get full text
Monograph -
15
Performance enhancement of AIMD algorithm for congestion avoidance and control
Published 2011“…National Chiao Tung University’s network simulation (NCTUns) has been used in this development to compare the new algorithm with the older versions and determine its advantages over the older versions. …”
Get full text
Get full text
Thesis -
16
Improving resource management with multi-instance broker scheduling algorithm in hierarchical grid computing
Published 2016“…Multi-Instance Broker Scheduling Algorithm (MiBSA) has been proposed as a new scheduling algorithm to get rid of the drawback from the iHLBA algorithm. …”
Get full text
Get full text
Get full text
Thesis -
17
Semiparametric inference procedure for the accelarated failure time model with interval-censored data
Published 2019“…The main contribution of this research is developing statistical approaches, and introducing new algorithms and resampling methods for analysing interval-censored data through AFT models.…”
Get full text
Get full text
Get full text
Thesis -
18
-
19
Ball surface representations using partial differential equations
Published 2015“…Hence, this new algorithm is a viable alternative for constructing generalized Ball surfaces. …”
Get full text
Get full text
Get full text
Thesis -
20
SEALiP: A simple and efficient algorithm for listing permutation via starter set method
Published 2013“…In order to demonstrate the algorithm, we are keen to list the permutations with the special references for cases of three and four objects.Based on this algorithm, a new method for listing permutations is developed and analyzed.This new permutation method will be compared with the existing lexicographic method.The results revealed that this new method is more efficient in terms of computation time.…”
Get full text
Get full text
Get full text
Article
