نتایج جستجو برای: that sometimes seems absolutely observational
تعداد نتایج: 6530428 فیلتر نتایج به سال:
In order to effectively communicate information, the choice of representation is important. Ideally, a representation will aid readers in making desired inferences. In this poster, we introduce the theory of observation: what it means for one statement to be observable from another. Using observability, we sketch a characterization of the observational advantages of one representation over anot...
Discrimination of regenerative cirrhotic nodules of the liver (CN) from hepatocellular carcinoma (HCC) is sometimes difficult. We examined the utility of AgNOR staining in this context. Fifteen cases of HCC and 25 cases of CN were stained by AgNOR method and the mean AgNOR number for one hundred nuclei in each case was determined. There was a significant difference between the mean AgNOR c...
Fundamental problem of cryptography is to create more absolutely secure bits than the initially shared secret bits between two legitimate users. It is widely believed that this task can only be accomplished by quantum cryptosystems. We present a simple classical cryptosystem, which can fulfill this objective.
This paper analyzes a model of learning by imitation, where besides the decision maker, there is a population of individuals facing the same decision problem. We analyze a property called Absolute Expediency, which requires that the decision maker’s expected payo¤ increases from one round to the next for every decision problem and every profile of realized actions taken by the population. We gi...
Different solution concepts (core, stable sets, largest consistent set, ...) can be defined using either a direct or an indirect dominance relation. Direct dominance implies indirect dominance, but not the reverse. Hence, the predicted outcomes when assuming myopic (direct) or farsighted (indirect) agents could be very different. In this paper, we characterize absolutely stable roommate problem...
Kingston (J Comb Theory (A) 20:357–363, 1976) and Anderson (J Comb Theory (A) 23:363, 1977) show that the probability that a given contestant wins a bestof-2k+1 series of asymmetric, zero-sum, binary-outcome games is, for a large class of assignment rules, independent of which contestant is assigned the advantageous role in each component game. We design a laboratory experiment to test this hyp...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید