Sciweavers

8838 search results - page 135 / 1768
» Generalizing Domain Theory
Sort
View
BIRTHDAY
2008
Springer
15 years 5 months ago
Selection and Uniformization Problems in the Monadic Theory of Ordinals: A Survey
Abstract. A formula ψ(Y ) is a selector for a formula ϕ(Y ) in a structure M if there exists a unique Y that satisfies ψ in M and this Y also satisfies ϕ. A formula ψ(X, Y )...
Alexander Rabinovich, Amit Shomrat
ICML
2010
IEEE
15 years 5 months ago
Efficient Selection of Multiple Bandit Arms: Theory and Practice
We consider the general, widely applicable problem of selecting from n real-valued random variables a subset of size m of those with the highest means, based on as few samples as ...
Shivaram Kalyanakrishnan, Peter Stone
DAGSTUHL
2006
15 years 5 months ago
Multisource Algorithmic Information Theory
Multisource information theory in Shannon setting is well known. In this article we try to develop its algorithmic information theory counterpart and use it as the general framewo...
Alexander Shen
TGC
2007
Springer
15 years 10 months ago
Computational Soundness of Equational Theories (Tutorial)
Abstract. We study the link between formal and cryptographic models for security protocols in the presence of passive and adaptive adversaries. We first describe the seminal resul...
Steve Kremer
AAAI
2008
15 years 6 months ago
Game Theory Pragmatics: A Challenge for AI
Game theory has been playing an increasingly visible role in computer science in general and AI in particular, most notably in the area of multiagent systems. I briefly list the a...
Yoav Shoham