نتایج جستجو برای: recourse allocation

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

Journal: :CoRR 2016
Haotian Jiang

Two-stage optimization with recourse model is an important and widely used model, which has been studied extensively these years. In this article, we will look at a new variant of it, called the two-stage optimization with recourse and revocation model. This new model differs from the traditional one in that one is allowed to revoke some of his earlier decisions and withdraw part of the earlier...

Journal: :فقه و اصول 0

in this article, aimed at promoting iranian statutes and increasing their applicatory aspects and for providing more and more financial security of society, the legal rule of i‘rāḍ (avoidance, abandonment) is deliberated on, which is a rule that is not clearly and extensively discussed but is the basis of some rules in iranian civil law. this has caused some obscurities, and sometimes, hasty de...

Journal: :ACM Computing Surveys 2022

Machine learning is increasingly used to inform decision making in sensitive situations where decisions have consequential effects on individuals’ lives. In these settings, addition requiring models be accurate and robust, socially relevant values such as fairness, privacy, accountability, explainability play an important role the adoption impact of said technologies. this work, we focus algori...

2017
Eric Van Cutsem Alfredo Falcone Rocio Garcia-Carbonero Yoshito Komatsu Alessandro Pastorino Marc Peeters Yasuhiro Shimada Kentaro Yamazaki Takayuki Yoshino Alberto Zaniboni Nadia Amellal Akira Kanehisa Robert Winkler Lukas Makris Robert J Mayer Atsushi Ohtsu Josep Tabernero

Background In the pivotal phase III, randomised, double-blind, placebo-controlled RECOURSE study, treatment with trifluridine/tipiracil was well tolerated and associated with prolonged progression-free and overall survival in patients with metastatic colorectal cancer (mCRC). There was no formal analysis of quality of life (QoL) in RECOURSE. The aim of the present analysis was to assess proxies...

Journal: :SIAM Journal on Optimization 1996
Werner Römisch Rüdiger Schultz

This paper investigates the stability of optimal solution sets to stochastic programs with complete recourse, where the underlying probability measure is understood as a parameter varying in some space of probability measures.piro proved Lipschitz upper semicontinuity of the solution set mapping. Inspired by this result, we introduce a subgradient distance for probability distributions and esta...

2012
Berk Ustun

Stochastic programming models are large-scale optimization problems that are used to facilitate decision-making under uncertainty. Optimization algorithms for such problems need to evaluate the expected future costs of current decisions, often referred to as the recourse function. In practice, this calculation is computationally difficult as it involves the evaluation of a multidimensional inte...

Journal: :BMC Health Services Research 2007
Ugo Fedeli Natalia Alba Elena Schievano Cristiana Visentin Rosalba Rosato Manuel Zorzi Giancarlo Ruscitti Paolo Spolaore

BACKGROUND Several previous studies conducted on cancer registry data and hospital discharge records (HDR) have found an association between hospital volume and the recourse to breast conserving surgery (BCS) for breast cancer. The aim of the current study is to depict concurrent time trends in the recourse to BCS and its association with hospital volume. METHODS Admissions of breast cancer p...

Journal: :Journal of Business & Economic Statistics 2022

Vector autoregression model is ubiquitous in classical time series data analysis. With the rapid advance of social network sites, over latent graph becoming increasingly popular. In this paper, we develop a novel Bayesian grouped to simultaneously estimate group information (number groups and configurations) group-wise parameters. Specifically, graphically assisted Chinese restaurant process in...

1996
George H. Polychronopoulos John N. Tsitsiklis

We consider shortest path problems defined on graphs with random arc costs. We assume that information on arc cost values is accumulated as the graph is being traversed. The objective is to devise a policy that leads from an origin to a destination node with minimal expected cost. We provide dynamic programming algorithms, estimates for their complexity, negative complexity results, and analysi...

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

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