نتایج جستجو برای: parameter set restriction
تعداد نتایج: 914439 فیلتر نتایج به سال:
Wake steering, the intentional yaw misalignment of certain turbines in an array, has demonstrated potential as a wind farm control approach to increase collective power. Existing algorithms optimize angle set-points using steady-state wake models and either deterministic frameworks or optimizers that account for direction variability uncertainty. rely on parameterizations physical phenomena mea...
GEL methods which generalize and extend previous contributions are defined and analysed for moment condition models specified in terms of weakly dependent data. These procedures offer alternative one-step estimators and tests that are asymptotically equivalent to their efficient two-step GMM counterparts. The basis for GEL estimation is via a smoothed version of the moment indicators using kern...
This paper studies bargaining between a seller and multiple buyers with externalities. A full characterization of the stationary subgame perfect equilibria in generic games is presented. Equilibria exist for generic parameter values, with delay only for strong positive externalities. The outcome is efficient if externalities are not too positive. Increasing the bargaining power of the seller de...
Whenever approximate and initial information about the unknown parameter of a distribution is available, the shrinkage estimation method can be used to estimate it. In this paper, first the $ E $-Bayesian estimation of the parameter of inverse Rayleigh distribution under the general entropy loss function is obtained. Then, the shrinkage estimate of the inverse Rayleigh distribution parameter i...
Turning restriction is one of the commonest traffic management techniques and an effective low cost traffic improvement strategy in urban road networks. However, the literature has not paid much attention to the turning restriction design problem (TRDP), which aims to determine a set of intersections where turning restrictions should be implemented. In this paper, a bi-level programming model i...
We study rigidity of rational maps that come from Newton's root finding method for polynomials arbitrary degrees. establish dynamical these maps: each point in the Julia set a Newton map is either rigid (i.e. its orbit can be distinguished combinatorial terms all other orbits), or this eventually lands filled-in polynomial-like restriction original map. As corollary, we show sets many non-trivi...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید