Search Results - (( java implementation path algorithm ) OR ( program case tree algorithm ))

Heavy Transportation Shortest Route using Dijkstra’s algorithm (HETRO) / Nurul Aqilah Ahmad Nezer by Ahmad Nezer, Nurul Aqilah

“…The development tools used in developing this project is NetBeans by using Java for the implementation of the coding. The methodology that used for developing this system is the Dijkstra’s algorithm. …”
Get full text
Get full text

Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization by Mohammad Ata, Karimeh Ibrahim

“…BST inserts the nodes in the way that the Dijkstra’s can find the empty parking in fastest way. Dijkstra’s algorithm initials the paths to finding the shortest path while ACO optimizes the paths. …”
Get full text
Get full text

Path planning for unmanned aerial vehicle (UAV) using rotated accelerated method in static outdoor environment by Shaliza Hayati A. Wahab, Nordin Saad, Azali Saudi, Ali Chekima

“…In this study, a fast iterative method known as Rotated Successive Over-Relaxation (RSOR) is introduced. The algorithm is implemented in a self-developed 2D Java tool, UAV Planner. …”
Get full text
Get full text
Get full text
Get full text

Case Slicing Technique for Feature Selection by A. Shiba, Omar A.

“…The classification accuracy obtained from the CST method is compared to other selected classification methods such as Value Difference Metric (VDM), Pre-Category Feature Importance (PCF), Cross-Category Feature Importance (CCF), Instance-Based Algorithm (IB4), Decision Tree Algorithms such as Induction of Decision Tree Algorithm (ID3) and Base Learning Algorithm (C4.5), Rough Set methods such as Standard Integer Programming (SIP) and Decision Related Integer Programming (DRIP) and Neural Network methods such as the Multilayer method.…”
Get full text
Get full text

Smart appointment organizer for mobile application / Mohd Syafiq Adam by Adam, Mohd Syafiq

“…The main component of this prototype is the use of Dijkstra algorithm to compute the shortest path from source of appointment to the 6 points of destinations within UiTM Shah Alam. …”
Get full text
Get full text

Predicting Student Performance in Object Oriented Programming Using Decision Tree : A Case at Kolej Poly-Tech Mara, Kuantan by Mohd Hanis, Rani, Abdullah, Embong

Get full text
Get full text

Designing of disparity map based on hierarchical dynamic programming using satellite stereo imagery by Qayyum A., Malik A.S., Naufal M., Saad M., Mazher M., Rasheed W., Abdullah T.A.R.B.T.

An efficient and effective case classification method based on slicing by Shiba, Omar A. A., Sulaiman, Md. Nasir, Mamat, Ali, Ahmad, Fatimah

“…The algorithms are: Induction of Decision Tree Algorithm (ID3) and Base Learning Algorithm (C4.5). …”
Get full text
Get full text
Get full text

Designing of disparity map based on hierarchical dynamic programming using satellite stereo imagery by Qayyum, A., Malik, A.S., Naufal, M., Saad, M., Mazher, M., Rasheed, W., Abdullah, T.A.R.B.T.

“…Electric supply companies monitor the vegetation/trees near power lines to avoid the blackouts that may occur in case of an improper monitoring of vegetation. …”
Get full text
Get full text

Towards a better feature subset selection approach by Shiba, Omar A. A.

“…The selection of the optimal features subset and the classification has become an important issue in the data mining field.We propose a feature selection scheme based on slicing technique which was originally proposed for programming languages.The proposed approach called Case Slicing Technique (CST).Slicing means that we are interested in automatically obtaining that portion 'features' of the case responsible for specific parts of the solution of the case at hand.We show that our goal should be to eliminate the number of features by removing irrelevant once.Choosing a subset of the features may increase accuracy and reduce complexity of the acquired knowledge.Our experimental results indicate that the performance of CST as a method of feature subset selection is better than the performance of the other approaches which are RELIEF with Base Learning Algorithm (C4.5), RELIEF with K-Nearest Neighbour (K-NN), RELIEF with Induction of Decision Tree Algorithm (ID3) and RELIEF with Naïve Bayes (NB), which are mostly used in the feature selection task.…”
Get full text
Get full text
Get full text

Quantum Processing Framework And Hybrid Algorithms For Routing Problems by Soltan Aghaei, Mohammad Reza

Get full text
Get full text

Twofold Integer Programming Model for Improving Rough Set Classification Accuracy in Data Mining. by Saeed, Walid

“…The accuracy for rules and classification resulted from the TIP method are compared with other methods such as Standard Integer Programming (SIP) and Decision Related Integer Programming (DRIP) from Rough Set, Genetic Algorithm (GA), Johnson reducer, HoltelR method, Multiple Regression (MR), Neural Network (NN), Induction of Decision Tree Algorithm (ID3) and Base Learning Algorithm (C4.5); all other classifiers that are mostly used in the classification tasks. …”
Get full text
Get full text

Integrated support vector regression and an improved particle swarm optimization-based model for solar radiation prediction by Ghazvinian H., Mousavi S.-F., Karami H., Farzin S., Ehteram M., Hossain M.S., Fai C.M., Hashim H.B., Singh V.P., Ros F.C., Ahmed A.N., Afan H.A., Lai S.H., El-Shafie A.

Energy-aware task scheduling for streaming applications on NoC-based MPSoCs by Abd Ishak, Suhaimi Abd Ishak, Wu, Hui, Tariq, Umair Ullah

“…Our approach is supported by a set of novel techniques, which include constructing an initial schedule based on a list scheduling where the priority of each task is its approximate successor-tree-consistent deadline such that the workload across all the processors is balanced, a retiming heuristic to transform intraperiod dependencies into inter-period dependencies for enhancing parallelism, assigning an optimal discrete frequency for each task and each message using a Non-Linear Programming (NLP)-based algorithm and an Integer-Linear Programming (ILP)-based algorithm, and an incremental approach to reduce the memory usage of the retimed schedule in case of memory size violations. …”
Get full text
Get full text
Get full text

Evolutionary cost-cognizant regression test case prioritization for object-oriented programs by Bello, AbdulKarim

“…Therefore, this study proposed a cost-cognizant TCP approach for object-oriented software that uses path-based integration testing to identify the possible execution path extracted from the Java System Dependence Graph (JSDG) model of the source code using forward slicing technique. …”
Get full text
Get full text

Ensemble deep learning approach for apple fruitlet detection from digital images by Yusof, Mohamad Yusnisyahmi, Ishak, Iskandar, Sidi, Fatimah

Get full text
Get full text
Get full text

Students’ attitude towards video-based learning: machine learning analysis with rapid software / Abdullah Sani Abd Rahman ... [et al.] by Abd Rahman, Abdullah Sani, Meutia, Rita, Hamid, Yusnaliza, Abdul Rahman, Rahayu

Get full text
Get full text
Get full text

Propositional satisfiability method in rough classification modeling for data mining by Abu Bakar, Azuraliza

“…Two models, Standard Integer Programming (SIP) and Decision Related Integer Programming (DRIP) to represent the minimal reduct computation problem were proposed. …”
Get full text
Get full text

The effectiveness of an agile software methodology: empirical evidence on humanistic aspects / Mazni Omar by Omar, Mazni

Get full text
Get full text