نتایج جستجو برای: stepwise algorithm
تعداد نتایج: 775346 فیلتر نتایج به سال:
Conclusion Jumping of legged mobile robots has been a highly motivated research area. When a running robot encounters obstacles comparable to its body height, jumping is one of the most effective ways to overcome them. Also, if the robots can jump over gaps or crevices, the mobility of robots in a wild field would be enhanced drastically.The jumping performance is dependent on the terrain prope...
Let G be a universal Chevalley group over an algebraically closed field and U− be the subalgebra of Dist(G) generated by all divided powers Xα,m with α < 0. We conjecture an algorithm to determine if Fe + ω 6= 0, where F ∈ U −, ω is a dominant weight and eω is a highest weight vector of the Weyl module ∆(ω). This algorithm does not use bases of ∆(ω) and is similar to the algorithm for irreducib...
potassium-argon analysis by stqwise dissolution provides a way to measure in detail the distribution of argon isotopes and potassium in rock salt. the method can be used for salt that contains only trace amounts of potassium, because the potassium and argon in detrital silicates within the salt are not released during the dissolution. water may be used as the solvent when relatively large amoun...
We introduce an innovation expansion method for estimation of factor models for conditional variance (volatility) of a multivariate time series. We estimate the factor loading space and the number of factors by a stepwise optimization algorithm on expanding the “white noise space”. Simulation and a real data example are given for illustration.
It was found that the traditional Mean Shift algorithm segmentation often produces the connection channel, several categories between clusters can not be completely separated from the problem, an improved classification of the structured mean shift segmentation algorithm iterations to obtain the initial cluster in center on the basis of different bandwidth matrix stepwise clustering, resulting ...
This article provides an overview of scar management within the forehead region. It addresses the unique challenges specific to the treatment of forehead wounds. A logical, stepwise approach is used. A subsite based treatment algorithm is provided along with a review of current best practices. Pertinent case examples are included for demonstration purposes.
there are many approaches for solving variety combinatorial optimization problems (np-compelete) that devided to exact solutions and approximate solutions. exact methods can only be used for very small size instances due to their expontional search space. for real-world problems, we have to employ approximate methods such as evolutionary algorithms (eas) that find a near-optimal solution in a r...
target tracking is the tracking of an object in an image sequence. target tracking in image sequence consists of two different parts: 1- moving target detection 2- tracking of moving target. in some of the tracking algorithms these two parts are combined as a single algorithm. the main goal in this thesis is to provide a new framework for effective tracking of different kinds of moving target...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید