Search Results - (( basic separation optimization algorithm ) OR ( java application during algorithm ))
Search alternatives:
- separation optimization »
- application during »
- basic separation »
- java application »
- during algorithm »
-
1
The design and applications of the african buffalo algorithm for general optimization problems
Published 2017“…Optimization, basically, is the economics of science. …”
Get full text
Get full text
Thesis -
2
Genetic algorithm optimization for coefficient of FFT processor
Published 2010Get full text
Get full text
Get full text
Article -
3
Synthesis of transistor chaining algorithm for CMOS cell layout using euler path / Sukri Hanafiah
Published 1997“…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
Thesis -
4
Fuzzy C means imputation of missing values with ant colony optimization
Published 2020“…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
Article -
5
Backtracking search algorithm for optimal power dispatch in power system / Mostafa Modiri Delshad
Published 2016“…Backtracking search algorithm (BSA) as the new evolutionary technique of optimization is used for solving the problems. …”
Get full text
Get full text
Thesis -
6
Multi-dimensional optimization of In0.53Ga0.47As thermophotovoltaic cell using real coded genetic algorithm
Published 2023“…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. …”
Article -
7
Satellite Image Segmentation Using Thresholding Technique
Published 2017“…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
Thesis -
8
SUDOKU HELPER
Published 2015“…In this paper research, author presents an algorithm to provide a tutorial for any Sudoku player who got stuck during the solving process. …”
Get full text
Get full text
Final Year Project -
9
Development an accurate and stable range-free localization scheme for anisotropic wireless sensor networks
Published 2022“…This study developed an optimized variation of the DV-Hop localization algorithm for anisotropic wireless sensor networks. …”
Get full text
Get full text
Thesis -
10
Automatic generic process migration system in linux
Published 2012“…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
Thesis -
11
Talkout : Protecting mental health application with a lightweight message encryption
Published 2022“…The investigation of lightweight message encryption algorithms is conducted with systematic quantitative literature and experiment implementation in Java and Android running environment. …”
Get full text
Get full text
Get full text
Academic Exercise -
12
Improved Segregated Advancement (I-SA): a new method for solving full triangular fuzzy transportation problems
Published 2023“…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
Article -
13
Improved Segregated Advancement (I-SA): a new method for solving full triangular fuzzy transportation problems
Published 2023“…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
Article -
14
Improved Segregated Advancement (I-SA): a new method for solving full triangular fuzzy transportation problems
Published 2023“…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
Article -
15
Improved Segregated Advancement (I-SA): a new method for solving full triangular fuzzy transportation problems
Published 2023“…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
Article -
16
Improved Segregated Advancement (I-SA): a new method for solving full triangular fuzzy transportation problems
Published 2022“…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
Article -
17
Improved Segregated Advancement (I-SA): a new method for solving full triangular fuzzy transportation problems
Published 2023“…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
Article -
18
Improved Segregated Advancement (I-SA): a new method for solving full triangular fuzzy transportation problems
Published 2023“…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
Article -
19
-
20
