1960 search results - page 74 / 392 » The Logic of Large Enough |
MICS
2010
13 years 6 months ago
2010
Abstract. Following Gaudry and G¨urel who extended Kedlaya’s point-counting algorithm to superelliptic curves, we introduce Harvey’s running time improvements for large enough...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
This article deals with some stochastic population protocols, motivated by theoretical aspects of distributed computing. We modelize the problem by a large urn of black and white ...
JMLR
2010
13 years 2 months ago
2010
The SGD-QN algorithm described in (Bordes et al., 2009) contains a subtle flaw that prevents it from reaching its design goals. Yet the flawed SGD-QN algorithm has worked well eno...
TR
2010
13 years 2 months ago
2010
Abstract--We quantify the closeness of the approximation between two high-level probabilistic models of cascading failure. In one model called CASCADE, failing components successiv...
JURIX
2008
13 years 9 months ago
2008
This paper extends our previous logical analysis of presumptions and burden of proof by studying the force of a presumption once counterevidence has been offered. In the jurisprude...