Search Results - (( java implementation path algorithm ) OR ( program features based algorithm ))
Search alternatives:
- java implementation »
- implementation path »
- program features »
- path algorithm »
- features based »
-
1
Heavy Transportation Shortest Route using Dijkstra’s algorithm (HETRO) / Nurul Aqilah Ahmad Nezer
Published 2017“…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
Thesis -
2
Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization
Published 2019“…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
Thesis -
3
Path planning for unmanned aerial vehicle (UAV) using rotated accelerated method in static outdoor environment
Published 2021“…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
Article -
4
Smart appointment organizer for mobile application / Mohd Syafiq Adam
Published 2009“…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
Thesis -
5
Case Slicing Technique for Feature Selection
Published 2004“…CST was compared to other selected classification methods based on feature subset selection such as Induction of Decision Tree Algorithm (ID3), Base Learning Algorithm K-Nearest Nighbour Algorithm (k-NN) and NaYve Bay~sA lgorithm (NB). …”
Get full text
Get full text
Thesis -
6
Long-term electrical energy consumption: Formulating and forecasting via optimized gene expression programming / Seyed Hamidreza Aghay Kaboli
Published 2018“…In the developed feature selection approach, multi-objective binary-valued backtracking search algorithm (MOBBSA) is used as an efficient evolutionary search algorithm to search within different combinations of input variables and selects the non-dominated feature subsets, which minimize simultaneously both the estimation error and the number of features. …”
Get full text
Get full text
Get full text
Thesis -
7
Intelligent agent for e-commerce using genetic algorithm / Kok Sun Sun
Published 2000“…Whereas the process of examining through the web pages, retrieving and searching the relevant data in a liTML page, and selecting the best satisfying data are based on the features and operations of the Genetic Algorithms.…”
Get full text
Get full text
Thesis -
8
Implementation of Autonomous Vehicle Navigation Algorithms Using Event-Driven Programming
Published 2012“…By using FSM to describe the behaviour of a navigating mobile robot, an equivalent algorithm can be developed. The algorithm can be relatively easy translated to a suitable program with event-driven programming technique. …”
Get full text
Get full text
Conference or Workshop Item -
9
Drone Based People Counter And Tracking Using Unique Id Using Opencv Python
Published 2020“…The purpose of this thesis is to implement an algorithm for drone-based square boundaries using Python and OpenCV. …”
Get full text
Get full text
Monograph -
10
-
11
Towards a better feature subset selection approach
Published 2010“…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
Conference or Workshop Item -
12
-
13
-
14
The Development of Color Based Visual Search Utility
Published 2001“…In this thesis, the issue of color-based image search was addressed with special emphasis on color feature. …”
Get full text
Get full text
Thesis -
15
Impact learning : A learning method from feature’s impact and competition
Published 2023“…Machine learning is the study of computer algorithms that can automatically improve based on data and experience. …”
Get full text
Get full text
Get full text
Get full text
Article -
16
Impact learning: A learning method from feature's impact and competition
Published 2023“…Machine learning is the study of computer algorithms that can automatically improve based on data and experience. …”
Get full text
Get full text
Get full text
Article -
17
Implementation of autonomous vehicle navigation algorithms using event-driven programming
Published 2012“…By using FSM to describe the behaviour of a navigating mobile robot, an equivalent algorithm can be developed. The algorithm can be relatively easy translated to a suitable program with event-driven programming technique. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
18
Evaluation of the effectiveness and efficiency of Wagner and Fischer algorithm in retrieving Hadith translated documents / Kamarul Arifin Muhamad
Published 2002“…Second experiment uses dynamic programmings apply with Wagner and Fischer algorithm.…”
Get full text
Get full text
Thesis -
19
Agent-based extraction algorithm for computational problem solving
Published 2015“…Therefore, utilizing the agent-based featured agents for this purpose is a benefit with the aim of helping novice programmers to understand the CPS without knowing the programming language. …”
Get full text
Get full text
Thesis -
20
Enhancement of Ant System Algorithm for Course Timetabling Problem
Published 2009“…This research starts with developing an algorithm based on original concept of Ant System Algorithm. …”
Get full text
Get full text
Get full text
Thesis
