نتایج جستجو برای: multiple constraints
تعداد نتایج: 926744 فیلتر نتایج به سال:
In this paper, a new approach for optimizing disparity candidates space is proposed for the solution of dense stereo matching problem. The main objectives of this approachare the reduction of average number of disparity candidates per pixel with low computational cost and high assurance of retaining the correct answer. These can be realized due to the effective use of multiple radial windows, i...
multiple people detection and tracking is a challenging task in real-world crowded scenes. in this paper, we have presented an online multiple people tracking-by-detection approach with a single camera. we have detected objects with deformable part models and a visual background extractor. in the tracking phase we have used a combination of support vector machine (svm) person-specific classifie...
In this paper, a new formulation along with numerical solution for the problem of finding a point-to-point trajectory with maximum load carrying capacities for flexible manipulators is proposed. For rigid manipulators, the major limiting factor in determining the Dynamic Load Carrying Capacity (DLCC) is the joint actuator capacity. The flexibility exhibited by light weight robots or by robots o...
the basic type of assembly line balancing (alb) problem is the allocation of work elements to a set of production work stations considering cycle time, precedence constraints, and assembly diagram to achieve predefined performance criteria such as line efficiency and smoothness index. in this paper, a mixed integer programming model for solving multiple product alb problems with processing time...
در این پایان نامه ابتدا نمادهای مرتبه و کاربرد این نمادها را معرفی می کنیم و سپس به روش آشفتگی multiple scales همراه با مثالی، پرداخته ایم. در بخش بعدی آن معادلات تفاضلی معمولی و اپراتورها را به طور کامل معرفی کرده ایم و در آخر نیز کاربرد روش آشفتگی multiple scales را برای حل معادلات تفاضلی با ارائه مثال توضیح می دهیم.
multiple objective programming (mop) problems have become famous among many researchers due to more practical and realistic implementations. there have been a lot of methods proposed especially during the past four decades. in this paper, we develop a new algorithm based on a new approach to solve mop problems by starting from a utopian point (which is usually infeasible) and moving towards the...
in this paper the real-world occurrence of the multiple-product multiple-constraint single period newsboy problem with two objectives, in which there is incremental discounts on the purchasing prices, is investigated. the constraints are the warehouse capacity and the batch forms of the order placements. the first objective of this problem is to find the order quantities such that the expected ...
This paper presents a heuristic for the dynamic vehicle scheduling problem with multiple resource capacity constraints. In the envisaged application, an automated transport system using Automated Guided Vehicles, bottleneck resources are (1) vehicles, (2) docks for loading/unloading, (3) vehicle parking places, and (4) load storage space. This problem is hard, because interrelated activities (l...
Predictive multiple suppression methods consist of two main steps: a prediction step, in which multiples are predicted from the seismic data, and a subtraction step, in which the predicted multiples are matched with the true multiples in the data. The last step appears crucial in practice: an incorrect adaptive subtraction method will cause multiples to be sub-optimally subtracted or primaries ...
We define and derive some properties of the different multiple view tensors. The multiple view geometry is described using a four-dimensional linear manifold in IR3m, wherem denotes the number of images. The Grassman coordinates of this manifold build up the components of the different multiple view tensors. All relations between these Grassman coordinates can be expressed using the quadratic p...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید