نتایج جستجو برای: multiple constraints
تعداد نتایج: 926744 فیلتر نتایج به سال:
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 we address symmetry on combinatorial problems by following the approach of imposing additional symmetry-breaking constraints. Differently from other works in the literature, we attack the problem at the specification level. In fact, sometimes symmetries on specifications can be very easily detected, and symmetry-breaking formulae generated. We give formal definitions of symmetries...
Many constraint problems exhibit dominance relations which can be exploited for dramatic reductions in search space. Dominance relations are a generalization of symmetry and conditional symmetry. However, unlike symmetry breaking which is relatively well studied, dominance breaking techniques are not very well understood and are not commonly applied. In this paper, we present formal definitions...
The two major paradigms in the theoretical agency literature are moral hazard (i.e., hidden action) and adverse selection (i.e., hidden information). Prior research typically solves these problems in isolation, as opposed to simultaneously incorporating both adverse selection and moral hazard features. We formulate two complementary generalized principalagent models that incorporate features ob...
We discuss diierent methods of reducing symmetry in CSPs where the variables correspond to the cells of a matrix, and both the rows and the columns of the matrix are interchangeable. Two basic approaches are considered: adding symmetry-breaking constraints to the model, and breaking symmetry during search. We also show how the two approaches can be combined in this case. We empirically compare ...
In an auction market where the price of each selling item is restricted to an admissible interval (price rigidities), a Walrasian equilibrium usually fails to exist. Dreze (1975) introduced a variant concept of Walrasian equilibrium based on rationing systems, named constrained Walrasian equilibrium, for modelling an economy with price rigidities. Talman and Yang (2008) further refined the conc...
where x, c, c ∈ R1 , x, c, c ∈ R2 , b ∈ R, A1 is an m × n1 matrix, A2 is an m × n2 matrix, and T denotes the transposition. Such problems may arise when there are two decision makers at different hierarchical levels having joint constraints and different and possibly conflicting objectives. The decision-making process is sequential. The leader controlling the variables of x has the first choice...
Various synthesis methods have been proposed in the literature for reversible and quantum logic circuits. However, there are few algorithms to optimize an existing circuit with multiple constraints simultaneously. In this paper, some heuristics in genetic algorithms (GA) to optimize a given circuit in terms of quantum cost, number of gates, location of garbage outputs, and delay, are proposed. ...
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...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید