due to the fact that the error surface of adaptive infinite impulse response (iir) systems is generally nonlinear and multimodal, the conventional derivative based techniques fail when used in adaptive identification of such systems. in this case, global optimization techniques are required in order to avoid the local minima. harmony search (hs), a musical inspired metaheuristic, is a recently ...

no unique method has been so far specified for determining the number of neurons in hidden layers of multi-layer perceptron (mlp) neural networks used for prediction. the present research is intended to optimize the number of neurons using two meta-heuristic procedures namely genetic and hill climbing algorithms. the data used in the present research for prediction are consumption data of water...

In this article, a new combined approach of a decision tree and clustering is presented to predict the transmission of genetic diseases. In this article, the performance of these algorithms is compared for more accurate prediction of disease transmission under the same condition and based on a series of measures like the positive predictive value, negative predictive value, accuracy, sensitivit...

abstract. in recent years several studies have shown that  control charts with adaptive schemes or double sampling plans detect both small and moderate shifts in the process mean more quickly than the traditional shewhart  chart. in the classical double sampling  chart, the difference between two points were placed in the central region of first stage was not considered. in this study, a new co...

In this paper, a set of new Real-Coded Genetic Algorithms (RCGAs) with local and global exploratory search capabilities are proposed. The search capabilities are based on the inclusion of a modified crossover procedure and a new global exploratory method in RCGA. The global exploratory method is based on vector projection while the modified crossover procedure is based on a limited version of t...

Let a graph G = (V;E) be given. In the path center problem we want to find a path P in G such that the maximum weighted distance of P to every vertex in V is minimized. In this paper a genetic algorithm and ahybrid of genetic and ant colony algorithms are presented for the path center problem. Some test problems are examined to compare the algorithms. The results show that for almost all exampl...

normal 0 false false false en-us x-none fa background:  regarding the importance of right diagnosis in medical applications, various methods have been exploited for processing medical images solar. the method of segmentation is used to analyze anal to miscall structures in medical imaging. objective:  this study describes a new method for brain magnetic resonance image (mri) segmentation via a ...