نتایج جستجو برای: binary imperialistic competition algorithm
تعداد نتایج: 930448 فیلتر نتایج به سال:
Today, the construction industry is facing intense competition and success in this competition depends on several factors. Project managers try to minimize project time and cost, carbon dioxide emission and at the same time maximizing the quality of project and its plan robustness. In this paper, study construction project scheduling considering a discrete trade-off between time, cost, quality,...
چکیده رقابت پذیری معیاری کلیدی برای ارزیابی درجه موفقیت کشورها،صنایع و بنگاهها در میدان های رقابتی سیاسی،اقتصادی و نجاری به حساب می آید.بدین معنی که هر کشور،صنعت یا بنگاهی که از توان رقابتی بالایی در بازارهای رقابتی برخوردار باشد،می توان گفت که از رقابت پذیری بالاتری برخوردار می باشد.در تحقیقات مختلف، رقابت پذیری در سه سطح ملی،صنعت و بنگاه مورد توجه قرار گرفته که در این میان سطح بنگاه از د...
Based on certain phenomena from the human society and nature, we propose a binary affinity genetic algorithm (aGA) by adopting the following strategies: the population is adaptively updated to avoid stagnation; the newly generated individuals are guaranteed to survive for certain number of generations in order for them to have enough time to develop their good genes; new individuals and the old...
This paper proposes a modification to the traditional binary search algorithm in which it checks the presence of the input element with the middle element of the given set of elements at each iteration. Modified binary search algorithm optimizes the worst case of the binary search algorithm by comparing the input element with the first & last element of the data set along with the middle elemen...
Let k be an integer and M be a closed 2-manifold with Euler characteristic χ(M) ≤ 0. We prove that each polyhedral map G on M with minimum degree δ and large number of vertices contains a k-path P , a path on k vertices, such that: (i) for δ ≥ 4 every vertex of P has, in G, degree bounded from above by 6k − 12, k ≥ 8 (It is also shown that this bound is tight for k even and that for k odd this ...
We introduce a new way of generating cutting planes of a mixed integer programme by way of taking binary variables. Four binary variables are introduced to form quartic inequalities, which results in a reduced first-level mixed integer programme. A new way of weakening the inequalities is presented. An algorithm to carryout the separation of the inequalities, which are exponential in number, is...
Metaheuristic algorithms have been widely used in determining the optimum rational polynomial coefficients (RPCs). By eliminating a number of unnecessary RPCs, these algorithms increase the accuracy of geometric correction of high-resolution satellite images. To this end, these algorithms use ordinary least squares and a number of ground control points (GCPs) to determine RPCs' values. Due to t...
feature extraction is a main step in all perceptual image hashing schemes in which robust features will led to better results in perceptual robustness. simplicity, discriminative power, computational efficiency and robustness to illumination changes are counted as distinguished properties of local binary pattern features. in this paper, we investigate the use of local binary patterns for percep...
The number of high resolution space imageries in photogrammetry and remote sensing society is growing fast. Although these images provide rich data, the lack of sensor calibration information and ephemeris data does not allow the users to apply precise physical models to establish the functional relationship between image space and object space. As an alternative solution, some generalized mode...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید