Sciweavers

Share
DAM
1999
70views more  DAM 1999»
8 years 11 months ago
On Maximal Shadows of Members in Left-compressed Sets
Whereas Stanley, Proctor and others studied Sperner properties of the poset L(k; m) we consider shadows of left-compressed sets and derive asymptotic bounds on their sizes. ? 1999...
Rudolf Ahlswede, Zhen Zhang
CCS
2001
ACM
9 years 3 months ago
The faithfulness of abstract protocol analysis: message authentication
hfulness of Abstract Protocol Analysis: Message Authentication∗ Joshua D. Guttman F. Javier Thayer Lenore D. Zuck December 18, 2002 Dolev and Yao initiated an approach to studyi...
Joshua D. Guttman, F. Javier Thayer, Lenore D. Zuc...
ALT
2008
Springer
9 years 8 months ago
Online Regret Bounds for Markov Decision Processes with Deterministic Transitions
Abstract. We consider an upper confidence bound algorithm for Markov decision processes (MDPs) with deterministic transitions. For this algorithm we derive upper bounds on the onl...
Ronald Ortner
books