Search Results - (( java implementation path algorithm ) OR ( using complex window 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

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

SLIDING WINDOW TRAINING ALGORITHMS USING MLP-NETWORK FOR CORRELATED AND LOST PACKET DATA by AHMED IZZELDIN, HUZAIFA TAWFEIG

“…The SW learning is investigated with different resetting criterion, diierent step size choices and different window sizes in addition to improving the existing SW module by proposing different data store management @SM) techniques that is used to reduce correlation inside the window store. …”
Get full text
Get full text

Stochastic partially optimized cyclic shift crossover for multi-objective genetic algorithms for the vehicle routing problem with time-windows by Zakaria, M.N.

“…This paper presents a stochastic partially optimized cyclic shift crossover operator for the optimization of the multi-objective vehicle routing problem with time windows using genetic algorithms. The aim of the paper is to show how the combination of simple stochastic rules and sequential appendage policies addresses a common limitation of the traditional genetic algorithm when optimizing complex combinatorial problems. …”
Get full text
Get full text

Stochastic partially optimized cyclic shift crossover for multi-objective genetic algorithms for the vehicle routing problem with time-windows by Pierre, D.M., Zakaria, N.

“…This paper presents a stochastic partially optimized cyclic shift crossover operator for the optimization of the multi-objective vehicle routing problem with time windows using genetic algorithms. The aim of the paper is to show how the combination of simple stochastic rules and sequential appendage policies addresses a common limitation of the traditional genetic algorithm when optimizing complex combinatorial problems. …”
Get full text
Get full text

Optimisation of vehicle routing problem with time windows using Harris Hawks optimiser by Chai, S. W., Kamaluddin, M. R., Ab Rashid, M. F. F.

“…The main objective of the study is to minimise the number of vehicles to be assigned for the routing problem subjected to the given time windows. The problem was optimised using a new algorithm known as Harris Hawks Optimiser (HHO). …”
Get full text
Get full text
Get full text

Power System Harmonics Estimation using Sliding Window Based LMS by Mohd Nor, Nursyarizal, Asirvadam , Vijanth Sagayan, Abdullah, M. F.

“…Thus it is important to precisely estimate the harmonics components that may help to avoid its harmful effect of the electrical grid performance. The more common algorithm that has been used to estimate the harmonic component is the Fast Fourier Transform (FFT), however FFT has few limitations,furthermore, modern power system network getting complex and noisy. …”
Get full text
Get full text

Damage visualization based on frequency shift of single-mode ultrasound-guided wavefield by Shahrim, Muhamad Azim, Harmin, Mohammad Yazdi, Romli, Fairuz Izzuddin, Chia, Chen Ciang, Jung-Ryul, Lee

“…Last but not least, the comparison of accuracy between frequency analysis algorithm and variable time window amplitude mapping (VTWAM) algorithm is performed. …”
Get full text
Get full text

Flexible window-based scheduling with critical worst case latency evaluations for real time traffic in time sensitive networks by Muftah, Shalghum Khaled

“…The first part introduces a flexible window-overlapping scheduling (FWOS) algorithm that allows the TT windows to overlap in GCL implementations. …”
Get full text
Get full text

Removal of high density salt and pepper noise from image and video based on optimal decision based algorithm by Khammar, Mohammad Reza, Saripan, M. Iqbal, Marhaban, Mohammad Hamiruce, Ishak, Asnor Juraiza

“…Detection is provided by using statistical analysis in each window, then the appropriate replacement for the noisy pixel is conducted from given values inside the current window or adjacent reconstructed pixels based on mean calculation and also, for very high density of noise which density of noise is bigger than 80%, the reconstruction is based on a recursive approach. …”
Get full text
Get full text

Towards lowering computational power in IoT systems: Clustering algorithm for high-dimensional data stream using entropy window reduction by Alkawsi G., Al-amri R., Baashar Y., Ghorashi S., Alabdulkreem E., Kiong Tiong S.

“…This paper introduces an Entropy Window Reduction (EWR) algorithm, which is an improved version of the BOCEDS technique. …”

Block Motion Estimation Using Directional Adaptive Search Window by Fadly Chew, Nor Farhana, Badruddin, Nasreen

“…This classification and the direction of the motion vectors, are used to dynamically adjust the search window size and general orientation. …”
Get full text
Get full text

Efficient management of Top-k queries over Uncertain Data Streams with dynamic Sliding Window Model by Raja Wahab, Raja Azhan Syah

“…However, there is a need to increase the number of studies investigating the issue of UDS using the Sliding Window Model (SWM). An inefficient approach to processing continuous queries on UDS with uncertainty over the SWM increased the complexity of semantic trade-offs between answering maximum probability and high-scoring result sets. …”
Get full text
Get full text
Get full text

Using streaming data algorithm for intrusion detection on the vehicular controller area network by Sharmin, Shaila, Mansor, Hafizah, Abdul Kadir, Andi Fitriah, Abdul Aziz, Normaziah

“…While the Isolation Forest (iForest) anomaly detection algorithm has a linear time complexity and low memory requirement, iForestASD adapts iForest by employing a sliding window that introduces the ability to handle concept drift, which is often characteristic of streaming data such as CAN bus traffic. …”
Get full text
Get full text
Get full text
Get full text
Get full text

An analysis of low complexity of 5G-MIMO communication system based CR using hybrid filter detection by Algriree, Waleed, Sulaiman, Nasri, Isa, Maryam, Sahbudin, Ratna K. Z., Hassan, Siti L. M., Hmood Salman, Emad, Alghrairi, Mokhalad

Get full text
Get full text

Formulating and solving stochastic truck and trailer routing problems using meta-heuristic algorithms / Seyedmehdi Mirmohammadsadeghi by Seyedmehdi, Mirmohammadsadeghi

“…Twenty one benchmark-instances have been modified for this case and solved by using the aforesaid algorithms. Afterward, the TTRPSD is extended by considering the time window constraints. …”
Get full text
Get full text
Get full text

Local-based stereo matching algorithm using multi-cost pyramid fusion, hybrid random aggregation and hierarchical cluster-edge refinement by Kadmin, Ahmad Fauzan

“…In this thesis, the accuracy of the proposed algorithm was evaluated using two standard online benchmarking database systems. …”
Get full text
Get full text
Get full text

Identification of Flower Species with Natural Markers by Tan, Mei Synn

“…The proposed method can successfully reduce the index value of features by 51.6%. In addition, the complexity of processing can be reduced from O(n log n) to O(n) after window selection phase, and the percentage of average accuracy for identifying flower species reached 98.8%. …”
Get full text
Get full text