کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
395907 | 666091 | 2009 | 14 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Two cooperative versions of the Guessing Secrets problem
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
هوش مصنوعی
پیش نمایش صفحه اول مقاله

چکیده انگلیسی
We investigate two cooperative variants (with and without lies) of the Guessing Secrets problem, introduced in [L. Chung, R. Graham, F.T. Leighton, Guessing secrets, Electronic Journal of Combinatorics 8 (2001)] in the attempt to model an interactive situation arising in the World Wide Web, in relation to the efficient delivery of Internet content. After placing bounds on the cardinality of the smallest set of questions needed to win the game, we establish that the algebra of all the states of knowledge induced by any designated game is a pseudocomplemented lattice. In particular, its join semilattice reduct is embeddable into the corresponding reduct of the Boolean algebra 2N-12N-1, where N is the cardinality of the search space.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Information Sciences - Volume 179, Issue 20, 29 September 2009, Pages 3645–3658
Journal: Information Sciences - Volume 179, Issue 20, 29 September 2009, Pages 3645–3658
نویسندگان
G. Sergioli, A. Ledda, F. Paoli, R. Giuntini, T. Kowalski, F. Montagna, H. Freytes, C. Marini,