Program evaluation as a decision problem

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Battleships as Decision Problem

We define the well-known puzzle of Battleships as a decision problem and prove it to be NPcomplete, by means of a parsimonious reduction. By applying Valiant and Vazirani’s (1986) result we immediately obtain that the variant of this problem, viz. promising that there is a unique solution, is NP-complete as well, under randomized reductions. As this finding is in sheer contrast with the general...

متن کامل

Recommendation as a Stochastic Sequential Decision Problem

Recommender systems — systems that suggest to users in e-commerce sites items that might interest them — adopt a static view of the recommendation process and treat it as a prediction problem. In an earlier paper, we argued that it is more appropriate to view the problem of generating recommendations as a sequential decision problem and, consequently, that Markov decision processes (MDPs) provi...

متن کامل

Interferometry as a binary decision problem

Binary decision theory has been applied to the general interferometric problem. Optimal detection scheme|according to the Neyman-Pearson criterion|has been considered for di erent phase-enhanced states of radiation eld, and the corresponding bounds on minimum detectable phase shift has been evaluated. A general bound on interferometric precision has been also obtained in terms of photon number ...

متن کامل

Data Swapping as a Decision Problem

We construct a decision-theoretic formulation of data swapping in which quantitative measures of disclosure risk and data utility are employed to select one release from a possibly large set of candidates. The decision variables are the swap rate, swap attribute(s) and possibly, constraints on the unswapped attributes. Risk–utility frontiers, consisting of those candidates not dominated in (ris...

متن کامل

Modeling of Partial Digest Problem as a Network flows problem

Restriction Site Mapping is one of the interesting tasks in Computational Biology. A DNA strand can be thought of as a string on the letters A, T, C, and G. When a particular restriction enzyme is added to a DNA solution, the DNA is cut at particular restriction sites. The goal of the restriction site mapping is to determine the location of every site for a given enzyme. In partial digest metho...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Econometrics

سال: 2005

ISSN: 0304-4076

DOI: 10.1016/j.jeconom.2004.04.006