Search Results - (( integer improving selection algorithm ) OR ( java implementation path 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

Optimizing tree planting areas through integer programming and improved genetic algorithm by Md Badarudin, Ismadi

“…Therefore, a hybrid algorithm through an incorporation of Integer Programming and Improved Genetic Algorithm was proposed for planting lining design. …”
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

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

Get full text
Get full text

Taguchi's T-method with nearest integer-based binary bat algorithm for prediction by Marlan Z.M., Jamaludin K.R., Ramlie F., Harudin N.

“…In this paper, a swarm-based binary bat optimization algorithm with a nearest integer discretization approach is integrated with the Taguchi�s T-method. …”

Determination of a good indicator for estimated prime factor and its modification in Fermat’s Factoring Algorithm by Mohd Tahir, Rasyid Redha, Asbullah, Muhammad Asyraf, Kamel Ariffin, Muhammad Rezal, Mahad, Zahari

“…Fermat’s Factoring Algorithm (FFA) is an integer factorisation methods factoring the modulus N using exhaustive search. …”
Get full text
Get full text
Get full text

Integration of enchanced jump point search (JPS) algorithm with modified bresenham technique for path planning in virtual grid-based environment by Nurul Atikah Janis

“…The second approach is the modification of heuristic computation using original A* and modified Bresenham. Bresenham Line Algorithm is a line generation algorithm using integer arithmetic where the points (x1, y1) and (x2, y2) are assumed not equal and integer valued. …”
Get full text
Get full text
Get full text

Randomized pixel selection for enhancing LSB algorithm security against brute-force attack by Mohamad Afendee, Mohamed, Ammar, Y. Tuama, Mohamad, A. Mohamed, Abdullah, Muhammed, Zurina, M. Hanapi

“…In this study, we propose a random selection of pixels that hold a secret message based on an integer solution of the elliptic curve equation. …”
Get full text
Get full text

Mathematical models and optimization algorithms for low-carbon Location-Inventory-Routing Problem with uncertainty by Liu, Lihua

“…Further more, an improved non-dominated sorting genetic algorithm with an elite strategy II (IMNSGA-II) has been developed to solve the two bi-objective models, surpassing existing literature’s algorithms such as Pareto Envelope-based Selection Algorithm II (PESA-II) and NSGA-II. …”
Get full text
Get full text
Get full text

Modified ant colony optimization algorithms for deterministic and stochastic inventory routing problems / Lily Wong by Lily , Wong

“…The computational results also show that the algorithms of population based ACO performs better than the algorithms of non-population based ACO. …”
Get full text
Get full text
Get full text

Efficient genetic partitioning-around-medoid algorithm for clustering by Garib, Sarmad Makki Mohammed

“…This study utilizes genetic algorithms based upon the medoid rather than the mean as a centroid-selection schema to improve the clustering efficiency. …”
Get full text
Get full text

Fpga Implementation Of Metaheuristic Optimization Algorithm by Phuah, Soon Eu

“…The selected metaheuristic was the Simulated Kalman Filter (SKF) which proposed an algorithm that was low in complexity and used a small number of steps. …”
Get full text
Get full text

Statistical modelling of time series of counts for a new class of mixture distributions / Khoo Wooi Chen by Khoo, Wooi Chen

“…Nevertheless, the hunt for better models is still ongoing due to the need to improve or sharpen the statistical analysis. This thesis proposes a new mixture model, the mixture of Pegram and thinning integer-valued autoregressive (MPT) processes, which is the combination of current discrete-valued time series operators. …”
Get full text
Get full text

FPGA implementation of metaheuristic optimization algorithm by Nurul Hazlina, Noordin, Phuah, Soon Eu, Zuwairie, Ibrahim

“…The selected metaheuristic was the Simulated Kalman Filter (SKF) which proposed an algorithm that was low in complexity and used a small number of steps. …”
Get full text
Get full text
Get full text

Separator Database and SPM Tree Framework for Mining Sequential Patterns Using Prefixspan with Pseudoprojection by Dhany, Saputra

“…Using Java as a case study, a series of experiment was conducted to select a suitable API class named Collections for this framework.The experimental results show that Separator Database always improves, exponentially in some cases, PrefixSpan with pseudoprojection. …”
Get full text

Separator Database and SPM Tree Framework for Mining Sequential Patterns Using Prefixspan with Pseudoprojection by Saputra , Dhany, Rambli, Dayang R.A., Foong, Oi Mean

“…Using Java as a case study, a series of experiment was conducted to select a suitable API class named Collections for this framework.The experimental results show that Separator Database always improves, exponentially in some cases, PrefixSpan with pseudoprojection. …”
Get full text
Get full text

Cryptanalysis on the modulus N=p2q and design of rabin-like cryptosystem without decryption failure by Asbullah, Muhammad Asyraf

“…The proposed method, called the Rabin-p cryptosystem has recorded an improvement which bears the idea of a failure-free decryption scenario. …”
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