1204 search results - page 164 / 241 » Hybrid Probabilistic Programs |
187
Voted
ATAL
2006
Springer
15 years 11 months ago
2006
Springer
We study information elicitation mechanisms in which a principal agent attempts to elicit the private information of other agents using a carefully selected payment scheme based o...
184
Voted
ICALP
1995
Springer
15 years 11 months ago
1995
Springer
We show that if a self-reducible set has polynomial-size circuits, then it is low for the probabilistic class ZPP(NP). As a consequence we get a deeper collapse of the polynomial-...
293
click to vote
WSC
2004
15 years 8 months ago
2004
Decision trees are one of the most easy to use tools in decision analysis. Problems where decision tree branches are based on random variables have not received much attention. Th...
218
Voted
IOR
2007
15 years 7 months ago
2007
We consider the problem of maximizing capacity in a queueing network with flexible servers, where the classes and servers are subject to failure. We assume that the interarrival ...
220
Voted
LICS
2010
IEEE
15 years 5 months ago
2010
IEEE
—We provide a syntactic analysis of contextual preorder and equivalence for a polymorphic programming language with effects. Our approach applies uniformly across a range of alge...