203 search results - page 39 / 41 » Datatype-Generic Termination Proofs |
102
click to vote
DSRT
2009
IEEE
15 years 3 months ago
2009
IEEE
Base Object Model (BOM) is a component-based standard designed to support reusability and Composability. Reusability helps in reducing time and cost of the development of a simula...
CRYPTO
2006
Springer
15 years 3 months ago
2006
Springer
In a seminal paper, Feldman and Micali (STOC '88) show an n-party Byzantine agreement protocol tolerating t < n/3 malicious parties that runs in expected constant rounds. H...
CORR
2010
Springer
14 years 11 months ago
2010
Springer
We prove several decidability and undecidability results for -PN, an extension of P/T nets with pure name creation and name management. We give a simple proof of undecidability of...
107
click to vote
IJFCS
2008
14 years 11 months ago
2008
Abstract. Recently, it has been shown that for any higher order pushdown system H and for any regular set C of configurations, the set pre H(C), is regular. In this paper, we give ...
ICML
1998
IEEE
16 years 13 days ago
1998
IEEE
tion Learning about Temporally Abstract Actions Richard S. Sutton Department of Computer Science University of Massachusetts Amherst, MA 01003-4610 rich@cs.umass.edu Doina Precup D...