Search Results - (( based constructive approach algorithm ) OR ( java implementation path algorithm ))
Search alternatives:
- constructive approach »
- java implementation »
- implementation path »
- based constructive »
- path algorithm »
-
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
Ant system-based feature set partitioning algorithm for classifier ensemble construction
Published 2016“…In this study, Ant system-based feature set partitioning algorithm for classifier ensemble construction is proposed.The Ant System Algorithm is used to form an optimal feature set partition of the original training set which represents the number of classifiers.Experiments were carried out to construct several homogeneous classifier ensembles using nearest mean classifier, naive Bayes classifier, k-nearest neighbor and linear discriminant analysis as base classifier and majority voting technique as combiner. …”
Get full text
Get full text
Get full text
Article -
6
An evolutionary based features construction methods for data summarization approach
Published 2015“…In this work, we empirically compare the predictive accuracies of classification tasks based on the proposed feature construction methods and also the existing feature construction methods. …”
Get full text
Get full text
Research Report -
7
-
8
Design and statistical analysis of initial solution construction approach in curriculum based course timetabling problem
Published 2017“…This paper investigates the construction phase approach in which the sequential order of the courses/lectures applied several combination of graph heuristics to generate a population of initial solutions in curriculum-based course timetabling (CBCTT).The construction of population of initial solution is a prerequisite in a population-based metaheuristic implementation. …”
Get full text
Get full text
Conference or Workshop Item -
9
A Data Mining Approach to Construct Graduates Employability Model in Malaysia
Published 2024Get full text
Article -
10
Ant system-based feature set partitioning algorithm for K-NN and LDA ensembles construction
Published 2015“…Combination of several classifiers has been very useful in improving the prediction accuracy and in most situations multiple classifiers perform better than single classifier.However not all combining approaches are successful at producing multiple classifiers with good classification accuracy because there is no standard resolution in constructing diverse and accurate classifier ensemble.This paper proposes ant system-based feature set partitioning algorithm in constructing k-nearest neighbor (k-NN) and linear discriminant analysis (LDA) ensembles. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
11
Harmony annealing algorithm for curriculum-based course timetabling problem
Published 2012“…An attempt to solve these problems was made via an approach broken down into two parts; first, constructive algorithm with saturation degree approach was used to ensure a feasible solution, where the hard constraints are satisfied.Secondly, Harmony annealing algorithm was used to further improve the results obtained.The algorithm produced results that were not comparatively better than those previously known as best solution.With proper modification in terms of the approach in this algorithm would make the algorithm perform better on curriculum-based course timetabling.…”
Get full text
Get full text
Get full text
Conference or Workshop Item -
12
Dynamic Bayesian networks and variable length genetic algorithm for designing cue-based model for dialogue act recognition
Published 2010“…The developed approach is evaluated against some of the previously used ranking approaches and the results provide experimental evidences on its ability to avoid the drawbacks of the ranking approaches. …”
Get full text
Get full text
Article -
13
-
14
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 -
15
Optimization of structural design for sustainable construction of transmission tower based on topographical algorithm
Published 2023“…The topographical algorithm is based on changing the inclination degree of the legs of the tower at first with optimum individual members sizing and later rationalized member sizes are performed through member groupings for the ease fabrication and construction of the transmission tower. …”
Conference paper -
16
Enhanced Intelligent Water Drops Algorithm for University Examination Timetabling Problems
Published 2024“…(iii) It is a constructive-based meta-heuristic algorithm which means, the solution is incrementally constructed (step by step) until the complete solution is obtained (Noferesti and Shah-Hosseini, 2012). …”
thesis::doctoral thesis -
17
Dynamic Bayesian Networks and Variable Length Genetic Algorithm for Dialogue Act Recognition
Published 2007“…The main drawbacks of these approaches are highlighted, and based on that an alternative approach is proposed. …”
Get full text
Get full text
Thesis -
18
Makespan algorithms and heuristic for internet-based collaborative manufacturing process using bottleneck approach
Published 2010“…This paper presents makespan algorithms and scheduling heuristic for an Internet-based collaborative design and manufacturing process using bottleneck approach. …”
Get full text
Get full text
Get full text
Article -
19
A multi-depot vehicle routing problem with stochastic road capacity and reduced two-stage stochastic integer linear programming models for rollout algorithm
Published 2021“…The proposed approach is suitable for obtaining a policy constructed dynamically on the go during the rollout algorithm. …”
Get full text
Get full text
Article -
20
Enhanced Community Detection Based On Cross Time For Higher Visibility In Supply Chain: A Six-Steps Model Framework
Published 2019“…This paper proposed six steps model framework that aim: (1) To construct the nodes and vertices for temporal graph representing the relationship in supply chain network; (2) To propose an enhanced temporal community detection algorithm in graph analytics based on Cross-time approach and (3) To evaluate the enhanced temporal community detection algorithm in graph analytics for representing relationship in supply chain network based on external and internal quality analysis. …”
Get full text
Get full text
Get full text
Article