نتایج جستجو برای: type algorithm
تعداد نتایج: 2040276 فیلتر نتایج به سال:
In today’s competitive market, those producers who can quickly adapt themselves todiverse demands of customers are successful. Therefore, in order to satisfy these demands of market, Mixed-model assembly line (MMAL) has an increasing growth in industry. A mixed-model assembly line (MMAL) is a type of production line in which varieties of products with common base characteristics are assembled o...
In this paper, we develop a new mathematical model for a cyclic multiple-part type threemachine robotic cell problem. In this robotic cell a robot is used for material handling. The objective is finding a part sequence to minimize the cycle time (i.e.; maximize the throughput) with assumption of known robot movement. The developed model is based on Petri nets and provides a new method to calcul...
In interval type-2 fuzzy logic controllers (IT2-FLCs), the output processing includes type reduction and defuzzification. Recently, researchers have proposed many efficient type reduction algorithms, but there are no effective schemes to improve the output of defuzzification. This paper presents a geneticalgorithm-based type reduction algorithm, which reduces the type of an interval type-2 fuzz...
in this thesis, a structured hierarchical methodology based on petri nets is used to introduce a task model for a soccer goalkeeper robot. in real or robot soccer, goalkeeper is an important element which has a key role and challenging features in the game. goalkeeper aims at defending goal from scoring goals by opponent team, actually to prevent the goal from the opponent player’s attacks. thi...
This paper deals with a bi-objective hybrid no-wait flowshop scheduling problem minimizing the makespan and total weighted tardiness, in which we consider transportation times between stages. Obtaining an optimal solution for this type of complex, large-sized problem in reasonable computational time by using traditional approaches and optimization tools is extremely difficult. This paper presen...
Given an undirected network G(V,A,c) and a perfect matching M of G, the inverse maximum perfect matching problem consists of modifying minimally the elements of c so that M becomes a maximum perfect matching with respect to the modified vector. In this article, we consider the inverse problem when the modifications are measured by the weighted bottleneck-type Hamming distance. We propose an alg...
a problem of computer vision applications is to detect regions of interest under dif- ferent imaging conditions. the state-of-the-art maximally stable extremal regions (mser) detects affine covariant regions by applying all possible thresholds on the input image, and through three main steps including: 1) making a component tree of extremal regions’ evolution (enumeration), 2) obtaining region ...
in this paper, an analytical method called the parametric iteration method (pim) is presented for solving the second-order singular ivps of lane-emden type, and its local convergence is discussed. since it is often useful to have an approximate analytical solution to describe the lane-emden type equa- tions, especially for ones where the closed-form solutions do not exist at all, therefore, an ...
the purpose of this paper is to study the convergence and the almost sure t-stability of the modied sp-type random iterative algorithm in a separable banach spaces. the bochner in-tegrability of andom xed points of this kind of random operators, the convergence and the almost sure t-stability for this kind of generalized asymptotically quasi-nonexpansive random mappings are obtained. our resu...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید