Sciweavers

118 search results - page 24 / 24
» A simple proof of Bazzi's theorem
Sort
View
POPL
2010
ACM
14 years 8 months ago
A Theory of Indirection via Approximation
Building semantic models that account for various kinds of indirect reference has traditionally been a difficult problem. Indirect reference can appear in many guises, such as hea...
Aquinas Hobor, Robert Dockins, Andrew W. Appel
COCO
1994
Springer
140views Algorithms» more  COCO 1994»
14 years 3 months ago
Random Debaters and the Hardness of Approximating Stochastic Functions
A probabilistically checkable debate system (PCDS) for a language L consists of a probabilisticpolynomial-time veri er V and a debate between Player 1, who claims that the input x ...
Anne Condon, Joan Feigenbaum, Carsten Lund, Peter ...
JELIA
2010
Springer
13 years 9 months ago
Stable Belief Sets Revisited
Stable belief sets were introduced by R. Stalnaker in the early ’80s, as a formal representation of the epistemic state for an ideal introspective agent. This notion motivated M...
Costas D. Koutras, Yorgos Zikos