1058 search results - page 128 / 212 » It's Doomed; We Can Prove It |
ICALP
2005
Springer
14 years 3 months ago
2005
Springer
We present a new primitive—Append-only Signatures (AOS)—with the property that any party given an AOS signature Sig[M1] on message M1 can compute Sig[M1 M2] for any message M2...
FOCS
2002
IEEE
14 years 3 months ago
2002
IEEE
Every compact orientable boundaryless surface M can be cut along simple loops with a common point v0, pairwise disjoint except at v0, so that the resulting surface is a topologica...
SEMWEB
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Military training and testing events are highly complex affairs, potentially involving dozens of legacy systems that need to interoperate in a meaningful way. There are s...
ICML
1996
IEEE
14 years 2 months ago
1996
IEEE
This paper presents a direct reinforcement learning algorithm, called Finite-Element Reinforcement Learning, in the continuous case, i.e. continuous state-space and time. The eval...
CADE
1994
Springer
14 years 2 months ago
1994
Springer
In this paper we investigate the concept of simple termination. A term rewriting system is called simply terminating if its termination can be proved by means of a simpli cation o...