166 search results - page 30 / 34 » When Is Uncertainty About Uncertainty Worth Characterizing |
120
Voted
MANSCI
2007
15 years 16 days ago
2007
Selection procedures are used in a variety of applications to select the best of a finite set of alternatives. ‘Best’ is defined with respect to the largest mean, but the me...
129
Voted
STOC
2009
ACM
16 years 1 months ago
2009
ACM
We study the question of basing symmetric key cryptography on weak secrets. In this setting, Alice and Bob share an n-bit secret W, which might not be uniformly random, but the ad...
101
Voted
AAAI
2007
15 years 3 months ago
2007
Recent work on online auctions for digital goods has explored the role of optimal stopping theory — particularly secretary problems — in the design of approximately optimal on...
99
Voted
AAAI
1994
15 years 2 months ago
1994
In this paper, we study the problem of achieving efficient interaction in a distributed scheduling system whose scheduling agents may borrow resources from one another. Specifical...
114
Voted
ENTCS
2008
15 years 22 days ago
2008
istic Abstract Interpretation of Imperative Programs using Truncated Normal Distributions Michael J. A. Smith1 ,2 Laboratory for Foundations of Computer Science University of Edinb...