A. Renyi. A diary on information theory, J. Wiley and Sons, 1994.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....of invisible chess, we employ a divide and conquer approach. We split the problem of choosing the next move into a number of simpler sub problems, and then use utility theory [17] to recombine the calculations performed for these sub problems into a move. We use informationtheoretic ideas [18] to deal with the uncertainty in the domain, and standard chess reasoning to deal with the strategic elements. This modular, hybrid approach is implemented with advisors or experts connected and controlled by a Game Controller and Distribution Maintenance Module (GCDMM) and a Maximiser. The ....

Alfred Renyi. A diary on information theory. John Wiley, 1984.

.... of its former use by Boltzmann and because no one knows what entropy really is, so in a debate you will always have the advantage (Tribus and McIrvine, Energy and information, Scientific American, 1971) For more details on the misteries of entropy we refer the reader to the book of Renyi [15]. Shannon himself extended the formula to measure the entropy of sources modeled by finite Markov chains; we refer the reader to the books on Information Theory and especially to the little book of Khinchin [7] where we found the first explicit mention of the relationship between compression and ....

A. Renyi. A Diary on Information Theory. John Wiley & Sons, New York, NY, 1984.

....can be computed as in standard backpropogation. Note that this algorithm requires the numerical evaluation of a complicated integral over the real line. Therefore, this algorithm is extremely slow and computationally inefficient. This problem can be solved by employing Renyi s entropy with 2 = [6]. Renyi s entropy with parameter is given by [7] d f e H e R ) log 1 1 ) 5) Note that, for 2 = this expression becomes as in (6) and minimization of this reduces the maximization of the information potential [6] d f e H e R ) log ) 2 2 (6) ....

.... can be solved by employing Renyi s entropy with 2 = 6] Renyi s entropy with parameter is given by [7] d f e H e R ) log 1 1 ) 5) Note that, for 2 = this expression becomes as in (6) and minimization of this reduces the maximization of the information potential [6] = d f e H e R ) log ) 2 2 (6) d f e V e ) 2 (7) In practice, the pdf of error is again estimated using Parzen windowing as shown in (3) and the gradient vector to be used in the steepest ascent algorithm for the maximization of the information potential ....

Renyi, A., A Diary on Information Theory, Wiley, NY, 1987.

....entropy H(X) exactly, but below we will find bounds on entropies of various configuration variables which are relevant to clone mapping. The reason that the entropy H(X) is the appropriate measure of information is explained in texts on information theory, see e.g. Cover and Thomas (1991) and Renyi (1984). We content ourselves here with a brief informal explanation, applicable when the elements of X are equally likely, each having probability 1=jX j, in which case H(X ) achieves its upper bound log 2 jX j. The argument goes like this: to identify any particular element x 2 X we consider successive ....

...., and this k is thus a lower bound to the number of such questions, equivalently bits of information, necessary to identify the particular element in question. More refined procedures can limit the amount of information necessary to log 2 jX j ffl where ffl 0 is as small as we wish, see e.g. Renyi (1984). A similar but more complicated argument applies when the elements of X are not equiprobable, see the discussion of the noiseless coding theorem in Cover and Thomas (1991) In this paper we study the entropy H(X) of a random configuration X most appropriate to the clone mapping problem. The study ....

Renyi, A. 1984. A diary on information theory. John Wiley & Sons, New York.

No context found.

A. Renyi. A diary on information theory, J. Wiley and Sons, 1994.

No context found.

A. Renyi. A diary on information theory, J. Wiley and Sons, 1994.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC