Search Results - (( java implementation tree algorithm ) OR ( basic separation optimization algorithm ))

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

Study and Implementation of Data Mining in Urban Gardening by Mohana, Muniandy, Lee, Eu Vern

“…Using the J48 tree algorithm implemented through WEKA API on a Java Servlet, data provided is processed to derive a health index of the plant, with the possible outcomes set to “Good,” “Okay”, or “Bad”. …”
Get full text
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

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

Adoption of machine learning algorithm for analysing supporters and non supporters feedback on political posts / Ogunfolajin Maruff Tunde by Ogunfolajin Maruff , Tunde

“…The method was implemented using Java and the results of the simulation were evaluated using five standard performance metrics: accuracy, AUC, precision, recall, and f-Measure. …”
Get full text
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

Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization by Mohammad Ata, Karimeh Ibrahim

“…This study proposes a car parking management system which applies Dijkstra’s algorithm, Ant Colony Optimization (ACO) and Binary Search Tree (BST) in structuring a guidance system for indoor parking. …”
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

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

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

Integrated artificial intelligence-based classification approach for prediction of acute coronary syndrome by Salari, Nader

“…In the development of the “hybrid AI-based” classification models, the proposed model (K1-K2- NN), was basically introduced through combining AI approaches of modified K-NN, genetic algorithm (GA), Fisher’s discriminant ratio (FDR) and class separability criteria (CSC). …”
Get full text
Get full text
Get full text