Search Results - (( parallel optimization method algorithm ) OR ( variable selection problem algorithm ))

Process Planning Optimization In Reconfigurable Manufacturing Systems by Musharavati, Farayi

“…Therefore, this study explores how to model reconfigurable manufacturing activities in an optimization perspective and how to develop and select appropriate non-conventional optimization techniques for reconfigurable process planning.In this study, a new approach to modeling Manufacturing Process Planning Optimization (MPPO) was developed by extending the concept of manufacturing optimization through a decoupled optimization method. …”
Get full text
Get full text

Development of a multi-objective optimization model for transport and environment in a closed-loop automotive supply chain by Sadrnia, Abdolhossein

“…To verify the model, four examples from literature were considered and compared the MOGSA’s optimum solutions result by Genetic Algorithm’s (GA) result. The results obtained from problem were analyzed based on the objective function (cost), and the design parameters of the network. …”
Get full text
Get full text

Voting algorithms for large scale fault-tolerant systems by Karimi, Abbas

“…To solve this problem and gain benefits of this algorithm, we employed parallel algorithm technique and by using optimal number of processors, we could propose optimal algorithms known as Parallel Average Voting and Parallel Weighted Average Voting which both have optimal time complexity and less calculation cost. …”
Get full text
Get full text

Development of an artificial neural network algorithm for predicting the cutting force in end milling of Inconel 718 alloy by Hossain, Ishtiaq, Amin, A. K. M. Nurul, Patwari, Muhammed Anayet Ullah

Get full text
Get full text
Get full text

Topology-aware hypergraph based approach to optimize scheduling of parallel applications onto distributed parallel architectures by Koohi, Sina Zangbari

“…Any optimization algorithm is suitable for only a specific domain of optimization problems. …”
Get full text
Get full text

Probabilistic ensemble fuzzy ARTMAP optimization using hierarchical parallel genetic algorithms by Loo, C.K., Liew, W.S., Seera, M., Lim, Einly

“…This was achieved by mitigating convergence in the genetic algorithms by employing a hierarchical parallel architecture. …”
Get full text
Get full text
Get full text

Investigation on the dynamic of computation of semi autonomous evolutionary computation for syntactic optimization of a set of programming codes by Mohammad Sigit Arifianto, Tze, Kenneth Kin Teo, Liau, Chung Fan, Liawas Barukang, Zaturrawiah Ali Omar

“…Genetic Algorithm as one of the Evolutionary Computation method improve the execution of parallel programming codes by optimizing the number of processors and the distribution of data. …”
Get full text
Get full text

Improved black-winged kite algorithm and finite element analysis for robot parallel gripper design by Haohao, Ma, As’arry, Azizan, Yanwei, Feng, Lulu, Cheng, Delgoshaei, Aidin, Ismail, Mohd Idris Shah, Ramli, Hafiz Rashidi

“…This paper presents a comprehensive study on the design optimization of a robotic gripper, focusing on both the gripper modeling and the optimization of its parallel mechanism structure. …”
Get full text
Get full text
Get full text

Sequential and parallel multiple tabu search algorithm for multiobjective urban transit scheduling problems by Uvaraja, Vikneswary

“…Additionally, the MTS algorithm is also implemented in parallel computing to produce parallel MTS for generating comparable solutions in shorter computational times. …”
Get full text
Get full text

Analysis of evolutionary computing performance via mapreduce parallel processing architecture / Ahmad Firdaus Ahmad Fadzil by Ahmad, Ahmad Firdaus

“…Examples of EC such as Genetic Algorithm (GA) and PSO (Particle Swarm Optimization) are prevalent due to their efficiency and effectiveness. …”
Get full text
Get full text

Distributed parallel deep learning with a hybrid backpropagation-particle swarm optimization for community detection in large complex networks by Shing, Chiang Ta, Mohammed Al-Andoli, Mohammed Nasser, Wooi, Ping Cheah

“…Next, the method is integrated with two optimization algorithms: (1) backpropagation (BP), which optimizes deep learning locally within each local chunk of the CN; (2) particle swarm optimization (PSO), which is used to improve the BP optimization involving all CN chunks. …”
Get full text
Get full text
Get full text
Get full text

PID Parameters Improvement for AGC in Three Parallel-Connected Power Systems by Mushtaq, Najeeb, Ramdan, Razali, K. G., Mohammed, Hamdan, Daniyal, Ali, M. Humada

“…The AGC loop is used to minimize the frequency deviation and control the power exchange in order to maintain them at their scheduled values due to the changes of the step-load disturbance. The optimal parameters of the PID scheme optimized by the proposed MS algorithm are compared with that one’s obtained by GA algorithm, and the proposed method has proven that its performance is more efficient and improved as well. …”
Get full text
Get full text
Get full text

Design and analysis of high performance matrix filling for DNA sequence alignment accelerator using asic design flow: article / Nurzaima Mahmod by Mahmod, Nurzaima

“…The scope of this paper is to optimize the DNA sequences alignment on the matrix rilling module by implementing a parallel method of the Smith-Waterman algorithm. …”
Get full text
Get full text

Feature selection and model selection algorithm using incremental mixed variable ant colony optimization for support vector machine classifier by Alwan, Hiba Basim, Ku-Mahamud, Ku Ruhana

“…In order to enhance SVM performance, these problems must be solved simultaneously because error produced from the feature subset selection phase will affect the values of the SVM parameters and resulted in low classification accuracy.Most approaches related with solving SVM model selection problem will discretize the continuous value of SVM parameters which will influence its performance.Incremental Mixed Variable Ant Colony Optimization (IACOMV) has the ability to solve SVM model selection problem without discretising the continuous values and simultaneously solve the two problems.This paper presents an algorithm that integrates IACOMV and SVM.Ten datasets from UCI were used to evaluate the performance of the proposed algorithm.Results showed that the proposed algorithm can enhance the classification accuracy with small number of features.…”
Get full text
Get full text
Get full text

Formulating new enhanced pattern classification algorithms based on ACO-SVM by Alwan, Hiba Basim, Ku-Mahamud, Ku Ruhana

“…ACO originally deals with discrete optimization problem.In applying ACO for solving SVM model selection problem which are continuous variables, there is a need to discretize the continuously value into discrete values.This discretization process would result in loss of some information and hence affects the classification accuracy and seeking time.In this algorithm we propose to solve SVM model selection problem using IACOR without the need to discretize continuous value for SVM.The second algorithm aims to simultaneously solve SVM model selection problem and selects a small number of features.SVM model selection and selection of suitable and small number of feature subsets must occur simultaneously because error produced from the feature subset selection phase will affect the values of SVM model selection and result in low classification accuracy.In this second algorithm we propose the use of IACOMV to simultaneously solve SVM model selection problem and features subset selection.Ten benchmark datasets were used to evaluate the proposed algorithms.Results showed that the proposed algorithms can enhance the classification accuracy with small size of features subset.…”
Get full text
Get full text
Get full text

Design and analysis of high performance matrix filling for DNA sequence alignment accelerator using ASIC design flow / Nurzaima Mahmod by Mahmod, Nurzaima

“…The scope of this paper is to optimize the DNA sequences alignment on the matrix filling module by implementing a parallel method of the SmithWaterman algorithm. …”
Get full text
Get full text

Robust variable selection methods for large- scale data in the presence of multicollinearity, autocorrelated errors and outliers by Uraibi, Hassan S.

“…To overcome the instability selection problem, a stability selection approach is put forward to enhance the performance of single-split variable selection method. …”
Get full text
Get full text

Application Of Genetic Algorithms For Robust Parameter Optimization by Belavendram, N.

“…Genetic algorithms (GA) are fairly recent in this respect but afford a novel method of parameter optimization. …”
Get full text
Get full text

Framework of Meta-Heuristic Variable Length Searching for Feature Selection in High-Dimensional Data by Qadir Saraf, Tara Othman, Fuad, Norfaiza, Md Taujuddin, Nik Shahidah Afifi

“…The literature contains various meta-heuristic algorithms with variable length searching. All of them enable searching in high dimensional problems. …”
Get full text
Get full text
Get full text

Framework of Meta-Heuristic Variable Length Searching for Feature Selection in High-Dimensional Data by Qadir Saraf, Tara Othman, Fuad, Norfaiza, Md Taujuddin, Nik Shahidah Afifi

“…The literature contains various meta-heuristic algorithms with variable length searching. All of them enable searching in high dimensional problems. …”
Get full text
Get full text
Get full text