نتایج جستجو برای: yield constraints

تعداد نتایج: 375233  

2004
Brahim Hnich Zeynep Kiziltan Toby Walsh

We introduce a new global constraint which combines together the lexicographic ordering constraint with some sum constraints. Lexicographic ordering constraints are frequently used to break symmetry, whilst sum constraints occur in many problems involving capacity or partitioning. Our results show that this global constraint is useful when there is a very large space to explore, such as when th...

1999
Tarek Ibrahim Pran Nath

We show that in theories with radiatively induced electro-weak symmetry breaking the EDMs obey a simple approximate scaling under the transformation m0 → λm0, m 1 2 → λm 1 2 in the large μ region. In the scaling region the knowledge of a single point in the MSSM parameter space where the cancellation in the EDMs occur allows one to generate a trajectory in the m0 −m 1 2 plane where the cancella...

Journal: :Kybernetika 2004
Jirí V. Outrata

The behaviour of firms on an oligopolistic market is usually modeled via the CournotNash equilibrium concept ([13, 18]). In fact, it is the classical Nash equilibrium, where each player (firm) maximizes its profit subject to production constraints. Assuming that one from the firms has a temporal advantage over the others, this firm can increase its profit by replacing a Cournot-Nash strategy by...

Journal: :CoRR 2012
Toby Walsh

Symmetry is an important problem in many combinatorial problems. One way of dealing with symmetry is to add constraints that eliminate symmetric solutions. We survey recent results in this area, focusing especially on two common and useful cases: symmetry breaking constraints for row and column symmetry, and symmetry breaking constraints for eliminating value symmetry.

2009
Justin Yip Pascal Van Hentenryck

This paper presents the first experimental evaluation of the length-lex domain for set variables. The implementation is based on bound-consistency algorithms proposed in earlier work and two novel technical contributions: a generic filtering algorithm which automatically pushes ordering constraints into symmetric binary constraints with only a logarithmic overhead and an adaptation of symmetry-...

Journal: :Finance and Stochastics 2006
Gordan Zitkovic

We establish existence of stochastic financial equilibria on filtered spaces more general than the ones generated by finite-dimensional Brownian motions. These equilibria are expressed in real terms and span complete markets or markets with withdrawal constraints. We deal with random endowment density streams which admit jumps and general time-dependent utility functions on which only regularit...

2004
J. L. Speyer

Stability results are given for a class of feedback systems arising from the regulation of time-varying discrete-time systems using optimal infinite-horizon and moving-horizon feedback laws. The class is characterized by joint constraints on the state and the control, a general nonlinear cost function and nonlinear equations of motion possessing two special properties. It is shown that weak con...

Journal: :علوم گیاهان زراعی ایران 0
مریم ثمن علی سپهری گودرز احمدوند سید حسین صباغپور

drought, specially in reproductive stage is one of the major constraints, limiting the productivity of crops, including chickpea (cicer arietinum l.). to study the effects of drought during pod set and seed filling stages (terminal drought) on phenology, growth and seed yield of 5 kabuli chickpea genotypes of: arman, jam, hasham, flip93-93 (azad) and ilc482, an experiment was conducted during t...

Journal: :ISPRS Int. J. Geo-Information 2016
Qingyun Du Zhi Dong Chudong Huang Fu Ren

A semantics-based method for density-based clustering with constraints imposed by geographical background knowledge is proposed. In this paper, we apply an ontological approach to the DBSCAN (Density-Based Geospatial Clustering of Applications with Noise) algorithm in the form of knowledge representation for constraint clustering. When used in the process of clustering geographic information, s...

2003
Marco Cadoli Toni Mancini

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...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید