نتایج جستجو برای: probability of winning demanded

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

Journal: :Logical Methods in Computer Science 2008
Luca de Alfaro Rupak Majumdar Vishwanath Raman Mariëlle Stoelinga

We consider two-player games played over finite state spaces for an infinite number of rounds. At each state, the players simultaneously choose moves; the moves determine a successor state. It is often advantageous for players to choose probability distributions over moves, rather than single moves. Given a goal (e.g., “reach a target state”), the question of winning is thus a probabilistic one...

2014
Chin-Ling Chen Yuan-Hao Liao Woei-Jiunn Tsaur

The attractive huge prize causes people to adore lotteries. Due to the very small probability of winning prizes, the players can enhance their probability of winning by using the method of joint purchase. In spite of many lottery schemes having been proposed, most e-lottery schemes focus on the players' privacy or computation overhead rather than support a joint purchase protocol on the Interne...

پایان نامه :0 1374

the following null hypothesis was proposed: h : there is no significant difference between the use of semantically or communicatively translates scientific texts. to test the null hypothesis, a number of procedures were taken first, two passages were selected form soyrcebooks of food and nutrition industry and gardening deciplines. each, in turn, was following by a number of comprehension quest...

2005
Krishnendu Chatterjee Luca de Alfaro Thomas A. Henzinger

The theory of graph games with ω-regular winning conditions is the foundation for modeling and synthesizing reactive processes. In the case of stochastic reactive processes, the corresponding stochastic graph games have three players, two of them (System and Environment) behaving adversarially, and the third (Uncertainty) behaving probabilistically. We consider two problems for stochastic graph...

Journal: :Electr. J. Comb. 2009
Robert W. Chen Alan Zame Burton Rosenberg

We consider a game in which players select strings over { 0, 1 } and observe a series of fair coin tosses, interpreted as a string over { 0, 1 }. The winner of this game is the player whose string appears first. For two players public knowledge of the opponent’s string leads to an advantage. In this paper, results for three players are presented. It is shown that given the choices of the first ...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه تحصیلات تکمیلی علوم پایه زنجان - دانشکده ریاضی 1393

in this thesis, a structured hierarchical methodology based on petri nets is used to introduce a task model for a soccer goalkeeper robot. in real or robot soccer, goalkeeper is an important element which has a key role and challenging features in the game. goalkeeper aims at defending goal from scoring goals by opponent team, actually to prevent the goal from the opponent player’s attacks. thi...

2012
Liang Chen De Liu

Many studies have been done on expert-rated crowdsourcing contests but few have examined crowd-rated contests in which winners are determined by the voting of the crowd. Due to the different rating mechanisms, determinants for winning may be different under two types of contests. Based on previous studies, we identify three types of winning determinants: expertise, submission timing, and social...

Journal: :Journal of personality and social psychology 2014
Eva C Buechel Jiao Zhang Carey K Morewedge Joachim Vosgerau

We propose that affective forecasters overestimate the extent to which experienced hedonic responses to an outcome are influenced by the probability of its occurrence. The experience of an outcome (e.g., winning a gamble) is typically more affectively intense than the simulation of that outcome (e.g., imagining winning a gamble) upon which the affective forecast for it is based. We suggest that...

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

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