نتایج جستجو برای: binary imperialistic competition algorithm

تعداد نتایج: 930448  

It is well-known that, given inorder traversal along with one of the preorder or postorder traversals of a binary tree, the tree can be determined uniquely. Several algorithms have been proposed to reconstruct a binary tree from its inorder and preorder traversals. There is one study to reconstruct a binary tree from its inorder and postorder traversals, and this algorithm takes running time of...

The human has always been to find the best in all things. This Perfectionism has led to the creation of optimization methods. The goal of optimization is to determine the variables and find the best acceptable answer Due to the limitations of the problem, So that the objective function is minimum or maximum. One of the ways inaccurate optimization is meta-heuristics so that Inspired by nature, ...

Journal: :iranian journal of fuzzy systems 2011
fethi jarray

we study the problem of reconstructing binary images from four projections data in a fuzzy environment. given the uncertainly projections,w e want to find a binary image that respects as best as possible these projections. we provide an iterative algorithm based on fuzzy integer programming and linear membership functions.

Journal: :journal of artificial intelligence in electrical engineering 2012
saeid jalilzade mehdi mardani

measurement of magnitude and frequency of the voltage flicker is very important for monitoring andcontrolling voltage flicker efficiently to improve the network power quality. this paper presents twonew methods for measurement of flicker signal parameters using shuffled frog leaping algorithm(sfla) and imperialist competitive algorithm (ica). this paper estimates fundamental voltage andflicker ...

It is well-known that, given inorder traversal along with one of the preorder or postorder traversals of a binary tree, the tree can be determined uniquely. Several algorithms have been proposed to reconstruct a binary tree from its inorder and preorder traversals. There is one study to reconstruct a binary tree from its inorder and postorder traversals, and this algorithm takes running time of...

2014
Mohsen Akbari Mohsen Riahi Manesh Ayman A El-Saleh Ahmed Wasif Reza

In diversity combining at the receiver, the output signal-to-noise ratio (SNR) is often maximized by using the maximal ratio combining (MRC) provided that the channel is perfectly estimated at the receiver. However, channel estimation is rarely perfect in practice, which results in deteriorating the system performance. In this paper, an imperialistic competitive algorithm (ICA) is proposed and ...

2011
Marijn Heule Matti Järvisalo Armin Biere

This paper develops techniques for efficiently detecting redundancies in CNF formulas. We introduce the concept of hidden literals, resulting in the novel technique of hidden literal elimination. We develop a practical simplification algorithm that enables “Unhiding” various redundancies in a unified framework. Based on time stamping literals in the binary implication graph, the algorithm appli...

Journal: :international journal of smart electrical engineering 2012
s.a hashemi zadeh o zeidabadi nejad s hasani a.a gharaveisi gh shahgholian

distributed generations (dgs) are utilized to supply the active and reactive power in the transmission and distribution systems. these types of power sources have many benefits such as power quality enhancement, voltage deviation reduction, power loss reduction, load shedding reduction, reliability improvement, etc. in order to reach the above benefits, the optimal placement and sizing of dg is...

Journal: :علوم گیاهان زراعی ایران 0
محمد جعفر بحرانی سید عبدالرضا کاظمینی

forage species in mixtures are extensively grown worldwide nowadays, particularly as a step towards sustainable agriculture, however, information on this topic is scanty in our country. thus a 2-year (2001-2003) field experiment was conducted to determine the forage yield, botanical composition, as well as competition of some forage grasses and legumes as mono and dual cultures combinations at ...

2009
Tong Xiao Mu Li Dongdong Zhang Jingbo Zhu Ming Zhou

Binarization of Synchronous Context Free Grammars (SCFG) is essential for achieving polynomial time complexity of decoding for SCFG parsing based machine translation systems. In this paper, we first investigate the excess edge competition issue caused by a leftheavy binary SCFG derived with the method of Zhang et al. (2006). Then we propose a new binarization method to mitigate the problem by e...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید