نتایج جستجو برای: expected profile update time

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

Journal: :Comput. J. 1985
Gordon V. Cormack R. Nigel Horspool Matthias Kaiserswerth

A practical method is presented that permits retrieval from a table in constant time. The method is suitable for large tables and consumes, in practice, O(n) space for n table elements. In addition, the table and the hashing function can be constructed in O(n) expected time. Variations of the method that offer different compromises between storage usage and update time are presented.

1995
David Alberts Monika Rauch Henzinger

[32] V. V. Vazirani. A theory of alternating paths and blossoms for proving correctness of the O(p V E) general graph maximum matching algorithm. [13] G. N. Frederickson. Ambivalent data structures for dynamic 2-edge-connectivity and k smallest spanning trees. Linear time algorithms for nding a sparse k-connected spanning subgraph of a k-connected graph. Re-randomization and average case analys...

2018
Thor Haahr Sandro C Esteves Peter Humaidan

Controlled ovarian stimulation with subsequent multi-follicular development continues to be a keystone in ART. Evidence supports an individualized approach to ovarian stimulation, usually involving combinations of ovarian reserve tests, body mass index and age to tailor the exogenous gonadotropin dose, and potentially adjuvant treatment aiming for high safety and a shortening of time to live bi...

2017
Takashi Tsuzuki Itsuki Chiba

In decision-making tasks with two attributes and three alternatives, the similarity effect implies that, if the total expected utility is equal between two opposite alternatives (i.e., the target and competitor), the probability of the target being chosen decreases with the addition of the decoy similar to the target. This study demonstrated the similarity-compromise effect, wherein the probabi...

2012
Lemao Liu Tiejun Zhao Taro Watanabe Hailong Cao Conghui Zhu

Minimum error rate training is a popular method for parameter tuning in statistical machine translation (SMT). However, the optimization objective function may change drastically at each optimization step, which may induce MERT instability. We propose an alternative tuning method based on an ultraconservative update, in which the combination of an expected task loss and the distance from the pa...

2013
Sebastian Ebert Christian Hilpert

Technical analysts, or chartists, aim at predicting future prices from past prices. To this end, for example, they draw resistance levels and Moving Average (MA) lines into stock price charts. We show that the widely employed MA cross-over rule is consistent with prospect theory preferences even when prices do not move in trends and when stock trading is unattractive to all rational expected ut...

Journal: :J. Economic Theory 2009
Enrico Diecidue Ulrich Schmidt Horst Zank

This paper provides preference foundations for parametric weighting functions under rank-dependent utility. This is achieved by decomposing the independence axiom of expected utility into separate meaningful properties. These conditions allow us to characterize rank-dependent utility with power and exponential weighting functions. Moreover, by allowing probabilistic risk attitudes to vary withi...

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

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