Search Results - (( basic separation optimization 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

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

The design and applications of the african buffalo algorithm for general optimization problems by Odili, Julius Beneoluchi

“…Optimization, basically, is the economics of science. …”
Get full text
Get full text

Genetic algorithm optimization for coefficient of FFT processor by Pang, Jia Hong, Sulaiman, Nasri

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

Synthesis of transistor chaining algorithm for CMOS cell layout using euler path / Sukri Hanafiah by Hanafiah, Sukri

“…After discussing about the introduction (the basic of CMOS transistor ), we will discuss how to create the Optimal layout of CMOS Functional Array with the minimum separation based on euler path method. …”
Get full text
Get full text

Fuzzy C means imputation of missing values with ant colony optimization by Mausor, F.H., Jaafar, J., Mohdtaib, S.

“…The advantage of FCM is it can provide a better separation of instances where it is not well separated. …”
Get full text
Get full text

Backtracking search algorithm for optimal power dispatch in power system / Mostafa Modiri Delshad by Mostafa, Modiri Delshad

“…Backtracking search algorithm (BSA) as the new evolutionary technique of optimization is used for solving the problems. …”
Get full text
Get full text

Multi-dimensional optimization of In0.53Ga0.47As thermophotovoltaic cell using real coded genetic algorithm by Gamel M.M.A., Ker P.J., Lee H.J., Rashid W.E.S.W.A., Hannan M.A., David J.P.R., Jamaludin M.Z.

“…Therefore, this work develops a multi-variable or multi-dimensional optimization of In0.53Ga0.47As TPV cell using the real coded genetic algorithm (RCGA) at various radiation temperatures. …”

Satellite Image Segmentation Using Thresholding Technique by Khalik, Mohd Haffez

“…The basic idea of automatic thresholding is to automatically select an optimal or several optimal grey-level threshold values for separating objects of interest in an image from the background based on their grey-level distribution. …”
Get full text
Get full text
Get full text

Development an accurate and stable range-free localization scheme for anisotropic wireless sensor networks by Han, Fengrong

“…This study developed an optimized variation of the DV-Hop localization algorithm for anisotropic wireless sensor networks. …”
Get full text
Get full text

Automatic generic process migration system in linux by Zarrabi, Amirreza

“…A fexible interface to the underlying checkpoint/ restart subsystem is designed which permits users to specify the migration mechanism according to process constraints. A migration algorithm is designed which attempts to exploit the unique features of the basic migration algorithms to form a generic algorithm. …”
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

Improved Segregated Advancement (I-SA): a new method for solving full triangular fuzzy transportation problems by Muhammad Sam’An, Muhammad Sam’An, Yosza Dasril, Yosza Dasril, Chandrasekar Ramasamy, Chandrasekar Ramasamy, Bujang, Nazarudin, Yahya, Nur Ifriza

“…Segregated advancement (SA) is a separation approach where the TFN represented by low, middle, and upper are solved part by part. …”
Get full text
Get full text
Get full text

Improved Segregated Advancement (I-SA): a new method for solving full triangular fuzzy transportation problems by Muhammad Sam’An, Muhammad Sam’An, Yosza Dasril, Yosza Dasril, Chandrasekar Ramasamy, Chandrasekar Ramasamy, Nazarudin Bujang, Nazarudin Bujang, Yahya Nur Ifriza, Yahya Nur Ifriza

“…Segregated advancement (SA) is a separation approach where the TFN represented by low, middle, and upper are solved part by part. …”
Get full text
Get full text
Get full text

Improved Segregated Advancement (I-SA): a new method for solving full triangular fuzzy transportation problems by Muhammad Sam’An, Muhammad Sam’An, Yosza Dasril, Yosza Dasril, Chandrasekar Ramasamy, Chandrasekar Ramasamy, Nazarudin Bujang, Nazarudin Bujang, Yahya Nur Ifriza, Yahya Nur Ifriza

“…Segregated advancement (SA) is a separation approach where the TFN represented by low, middle, and upper are solved part by part. …”
Get full text
Get full text
Get full text

Improved Segregated Advancement (I-SA): a new method for solving full triangular fuzzy transportation problems by Muhammad Sam’An, Muhammad Sam’An, Yosza Dasril, Yosza Dasril, Chandrasekar Ramasamy, Chandrasekar Ramasamy, Nazarudin Bujang, Nazarudin Bujang, Yahya Nur Ifriza, Yahya Nur Ifriza

“…Segregated advancement (SA) is a separation approach where the TFN represented by low, middle, and upper are solved part by part. …”
Get full text
Get full text
Get full text

Improved Segregated Advancement (I-SA): a new method for solving full triangular fuzzy transportation problems by Muhammad Sam’An, Muhammad Sam’An, Yosza Dasril, Yosza Dasril, Chandrasekar Ramasamy, Chandrasekar Ramasamy, Nazarudin Bujang, Nazarudin Bujang, Yahya Nur Ifriza, Yahya Nur Ifriza

“…Segregated advancement (SA) is a separation approach where the TFN represented by low, middle, and upper are solved part by part. …”
Get full text
Get full text
Get full text

Improved Segregated Advancement (I-SA): a new method for solving full triangular fuzzy transportation problems by Muhammad Sam’An, Muhammad Sam’An, Yosza Dasri, Yosza Dasri, Chandrasekar Ramasamy, Chandrasekar Ramasamy, Nazarudin Bujang, Nazarudin Bujang, Yahya Nur Ifriza, Yahya Nur Ifriza

“…Segregated advancement (SA) is a separation approach where the TFN represented by low, middle, and upper are solved part by part. …”
Get full text
Get full text
Get full text