Sciweavers

7988 search results - page 76 / 1598
» A Useful Undecidable Theory
Sort
View
ICSE
2001
IEEE-ACM
14 years 1 months ago
Theory of Software Reliability Based on Components
We present a foundational theory of software system reliability based on components. The theory describes how component developers can design and test their components to produce ...
Richard G. Hamlet, David V. Mason, Denise M. Woit
IPPS
2006
IEEE
14 years 2 months ago
Cooperative checkpointing theory
Cooperative checkpointing uses global knowledge of the state and health of the machine to improve performance and reliability by dynamically deciding when to skip checkpoint reque...
Adam J. Oliner, Larry Rudolph, Ramendra K. Sahoo
IJCAI
2003
13 years 10 months ago
Monte Carlo Theory as an Explanation of Bagging and Boosting
In this paper we propose the framework of Monte Carlo algorithms as a useful one to analyze ensemble learning. In particular, this framework allows one to guess when bagging will ...
Roberto Esposito, Lorenza Saitta
INFORMATICALT
2010
134views more  INFORMATICALT 2010»
13 years 6 months ago
Observability of Turing Machines: A Refinement of the Theory of Computation
The Turing machine is one of the simple abstract computational devices that can be used to investigate the limits of computability. In this paper, they are considered from several ...
Yaroslav D. Sergeyev, Alfredo Garro
BSL
2004
100views more  BSL 2004»
13 years 8 months ago
Forcing in proof theory
Paul Cohen's method of forcing, together with Saul Kripke's related semantics for modal and intuitionistic logic, has had profound effects on a number of branches of mat...
Jeremy Avigad