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

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

Journal: :Humanities & Social Sciences Reviews 2019

Journal: :Critical Care 2006
Manoj K Saxena Peter JD Andrews

While we must applaud industry and the Recombinant Human Protein C Worldwide Evaluation in Severe Sepsis (PROWESS) investigators [1] for the tremendous effort and time expended in their multicentre, international study, caution needs to be exercised before deciding to make the intervention of activated protein C (APC) a standard of treatment [2]. We, like many others, have chosen to introduce A...

2013
Xianchi Dai Ayelet Fishbach

We explore how waiting to choose influences patience. We propose that waiting to make an intertemporal choice increases the assumed value of the items for which people are waiting, leading them to become more patient. Five studies support this model. Study 1 finds that after waiting to choose, people exhibit greater patience than if they had not waited or before they had started to wait. Studie...

Journal: :Iranian Journal of Psychiatry and Behavioral Sciences 2015

Hosna Akbari , Mohammad Esmaeil Akbari ,

Introduction: The growing trend of cancer incidence in the past few decades and its effects on physical, psychological, spiritual, and social dimensions both in patients and their families make cancer one of the major health hazards of the century. Of all cancers, breast cancer (BC) is the most prevalent among females. Thus, the current study aimed at comparing three components of BC between fe...

2014
Christian C. Luhmann Michael Bixter

Delay discounting refers to decision makers’ tendency to treat immediately consumable goods as more valuable than those only available after some delay. Previous work has focused on a seemingly irrational feature of these preferences: the systematic tendency to exhibit more patience when consequences are far in the future but less patience about those same, identical rewards as time passes. One...

2016
John Augustine William K. Moses Amanda Redlich Eli Upfal

Load balancing is a well-studied problem, with balls-in-bins being the primary framework. The greedy algorithm Greedy[d] of Azar et al. places each ball by probing d > 1 random bins and placing the ball in the least loaded of them. It ensures a maximum load that is exponentially better than the strategy of placing each ball uniformly at random. Vöcking showed that a slightly asymmetric variant,...

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

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