نتایج جستجو برای: type algorithm
تعداد نتایج: 2040276 فیلتر نتایج به سال:
In vehicle surveillance systems, one of the appropriate methods for recognition are 3-D models. Several methods have been proposed for this purpose. Feature based methods are most significant and widely used. In this paper, is proposed an algorithm within recognition framework. Proposed algorithm is considered information of image and model edges as feature. A block descriptor has been used ext...
Optimisation of stacking sequence for composite plates under slamming impact loads using genetic algorithm method is studied in this paper. For this purpose, slamming load is assumed to have a uniform distribution with a triangular-pulse type of intensity function. In order to perform optimisation based on the genetic algorithm method, a special code is written in MATLAB software environment. T...
Bus network design is an important problem in public transportation. The main step to this design, is determining the number of required terminals and their locations. This is an especial type of facility location problem, a large scale combinatorial optimization problem that requires a long time to be solved. Branch & bound and simulated annealing methods have already been used for solving Urb...
This research presents a new application of the cloud theory-based simulated annealing algorithm to solve mixed model assembly line sequencing problems where line stoppage cost is expected to be optimized. This objective is highly significant in mixed model assembly line sequencing problems based on just-in-time production system. Moreover, this type of problem is NP-hard and solving this probl...
Increasing the use of Internet and some phenomena such as sensor networks has led to an unnecessary increasing the volume of information. Though it has many benefits, it causes problems such as storage space requirements and better processors, as well as data refinement to remove unnecessary data. Data reduction methods provide ways to select useful data from a large amount of duplicate, incomp...
We study zero-sum dynamic games with deterministic transitions and alternating moves of the players. Player 1 aims at reaching a terminal set and minimising a running and final cost. We propose and analyse an algorithm that computes the value function of these games extending Dijkstra’s algorithm for shortest paths on graphs. We also show the connection of these games with numerical schemes for...
Eigendecompositions play a very important role in a variety of signal processing applications. In this paper, we derive and study an algorithm for Generalized Eigendecomposition which is both on-line and fast converging. A rule to extract the maximum eigencomponent is first presented, and then on-line deflation is applied to estimate the minor components. Proof of convergence has been establish...
Let S(v) be a function deened on the vertices v of the innnite binary tree. One algorithm to seek large positive values of S is the Metropolis-type Markov chain (X n) deened by P (X n+1 = wjX n = v) = 1 3 e b(S(w)?S(v)) 1 + e b(S(w)?S(v)) for each neighbor w of v, where b is a parameter (\1=temperature") which the user can choose. We introduce and motivate study of this algorithm under a probab...
in this paper, modi cation of the optimal homotopy asymptotic method (moham) is appliedupon singular initial value lane-emden type equations and results are compared with the available exactsolutions. the modi ed algorithm give the exact solution for di erential equations by using one iterationonly.
Question type (or answer type) classification is the task of determining the correct type of the answer expected to a given query. This is often done by defining or discovering syntactic patterns that represent the structure of typical queries of each type, and classify a given query according to which pattern they satisfy. In this paper, we combine the idea of using informer spans as patterns ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید