641 search results - page 90 / 129 » Formal Reliability Analysis Using Theorem Proving |
JSC
2006
13 years 8 months ago
2006
In this paper we show that a large class of cut-elimination methods can be analyzed by clause terms representing sets of characteristic clauses extractable from the original proof...
ICML
2003
IEEE
14 years 2 months ago
2003
IEEE
Shaping can be an effective method for improving the learning rate in reinforcement systems. Previously, shaping has been heuristically motivated and implemented. We provide a for...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
One possible escape from the Gibbard-Satterthwaite theorem is computational complexity. For example, it is NP-hard to compute if the STV rule can be manipulated. However, there is...
ESCIENCE
2006
IEEE
14 years 16 days ago
2006
IEEE
In this paper we present a general domain for the analysis of workflows and workflow components based on the notion of a collection of Turing machines sharing a set of tapes. We s...
JCS
2010
13 years 7 months ago
2010
A model of resource access control is presented in which the access control to resources can employ user interaction to obtain the necessary permissions. This model is inspired by...