Sciweavers

7988 search results - page 283 / 1598
» A Useful Undecidable Theory
Sort
View
CORR
2004
Springer
90views Education» more  CORR 2004»
15 years 5 months ago
A note on dimensions of polynomial size circuits
In this paper, we use resource-bounded dimension theory to investigate polynomial size circuits. We show that for every i 0, P/poly has ith-order scaled p3 -strong dimension 0. W...
Xiaoyang Gu
DC
2000
15 years 5 months ago
Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case study
ms, to use abstraction mappings to prove probabilistic properties, and to apply random walk theory in a distributed computational setting. We apply all of these techniques to analy...
Anna Pogosyants, Roberto Segala, Nancy A. Lynch
MOC
2000
122views more  MOC 2000»
15 years 5 months ago
Explicit resolutions of cubic cusp singularities
Resolutions of cusp singularities are crucial to many techniques in computational number theory, and therefore finding explicit resolutions of these singularities has been the focu...
H. G. Grundman
125
Voted
NGC
2002
Springer
15 years 5 months ago
Chance Discovery and Scenario Analysis
Scenario analysis is often used to identify possible chance events. However, no formal, computational theory yet exists for scenario analysis. In this paper, we commence developme...
Peter McBurney, Simon Parsons
SYNTHESE
2010
101views more  SYNTHESE 2010»
15 years 3 months ago
Bayesian probability
“Bayesian probability” here means the concept of probability used in Bayesian decision theory. It is usually identified with the agent’s degrees of belief but that interpret...
Patrick Maher