نتایج جستجو برای: rebalancing

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

Journal: :SSRN Electronic Journal 2010

Journal: :Counselling and Psychotherapy Research 2021

Burnout is an experience in response to chronic job stressors, understood be composed of three components: exhaustion, cynicism and inefficacy. occupational hazard among psychotherapists that may result poorer quality care for clients a diminished life clinicians. Several quantitative studies have shown are at risk developing burnout given the demanding nature their work. While much research ha...

2013
Alexi Savov

This document contains two sections that elaborate on the analysis in “The Price of Skill: Performance Evaluation by Households”. The first solves the portfolio-choice problem of a household with non-traded income. The results connect shocks to beliefs and rebalancing in greater detail than in the paper. The second section presents a set of robustness checks and extensions of the empirical anal...

2004
Jeff Hartline

We present an alternative to tree rebalancing for improving the expected search cost in weighted binary search trees. This alternative is based on the insertion of shortcut links between nodes in the search tree. We propose several shortcut models and give polynomial time algorithms to find the best shortcuts for two of these models.

Journal: :Stroke 2010
Pitchaiah Mandava Yogeshwar V Kalkonde Ryan H Rochat Thomas A Kent

BACKGROUND AND PURPOSE Outcome from stroke is highly dependent on baseline conditions. Patients with stroke have a wide range of severities, ages, and etiologies and it has proven difficult to achieve randomization of key variables in clinical trials. We present a new post hoc approach to achieve balance among selected variables. To illustrate the approach, we rebalanced the National Institute ...

2016
Meng He Mengdu Li

We present a provably linearizable and lock-free relaxed AVL tree called the non-blocking ravl tree. At any time, the height of a non-blocking ravl tree is upper bounded by logφ(2m) + c, where φ is the golden ratio, m is the total number of successful INSERT operations performed so far and c is the number of active concurrent processes that have inserted new keys and are still rebalancing the t...

1997
Joaquim Gabarró Xavier Messeguer Daniel Riu

The HyperRed-Black trees are a relaxed version of RedBlack trees accepting high degree of concurrency. In the Red-Black trees consecutive red nodes are forbidden. This restriction has been withdrawn in the Chromatic trees. They have been introduced by O. Nurmi and E. Soisalon-Soininen to work in a concurrent environment. A Chromatic tree can have big clusters of red nodes surrounded by black no...

2010

1 Great changes are taking place in the world economy. The center of gravity is moving to Asia and the emerging world. This has been recognized in the landmark agreement on IMF reform reached at the last G20 Ministerial meeting. China has become the IMF's third shareholder, India has moved up by five ranks and Brazil is now on par with Canada (a G7 country). Symmetrically, the European represen...

2007
HELGE HOLDEN

Rebalancing of portfolios with a concave utility function is considered. It is proved that transaction costs imply that there is a no-trade region where it is optimal not to trade. For proportional transaction costs it is optimal to rebalance to the boundary when outside the no-trade region. With flat transaction costs, the rebalance from outside the no-trade region should be to an internal sta...

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

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