74 search results - page 11 / 15 » Every Computably Enumerable Random Real Is Provably Computab... |
SPIN
2004
Springer
14 years 1 months ago
2004
Springer
The Murϕ-based Hopper tool is a general purpose explicit model checker. Hopper leverages Murϕ’s class structure to implement new algorithms. Hopper differs from Murϕ in that i...
JSYML
2010
13 years 6 months ago
2010
Continuous first-order logic has found interest among model theorists who wish to extend the classical analysis of “algebraic” structures (such as fields, group, and graphs) ...
IPPS
1997
IEEE
13 years 11 months ago
1997
IEEE
In this paper we show the power of sampling techniques in designing efficient distributed algorithms. In particular, we show that using sampling techniques, on some networks, sele...
KDD
2007
ACM
14 years 8 months ago
2007
ACM
Typical approaches to multi-label classification problem require learning an independent classifier for every label from all the examples and features. This can become a computati...
RTAS
2005
IEEE
14 years 1 months ago
2005
IEEE
No one middleware communication model completely solves the problem of ensuring schedulability in every DRE system. Furthermore, there have been few studies to date of the trade-o...