228 search results - page 11 / 46 » Two Normal Forms for Rewriting P Systems |
ICTAC
2004
Springer
14 years 22 days ago
2004
Springer
We give an inductive method for proving weak innermost termination of rule-based programs, from which we automatically infer, for each successful proof, a finite strategy for data...
CHES
2001
Springer
13 years 12 months ago
2001
Springer
Abstract. In this paper we show how using a representation of an elliptic curve as the intersection of two quadrics in P3 can provide a defence against Simple and Differental Powe...
FSTTCS
2008
Springer
13 years 8 months ago
2008
Springer
ABSTRACT. Formalisms involving some degree of nondeterminism are frequent in computer science. In particular, various programming or specification languages are based on term rewr...
ACNS
2006
Springer
14 years 1 months ago
2006
Springer
Unstructured P2P systems have gained great popularity in recent years and are currently used by millions of users. One fundamental property of these systems is the lack of structu...
INFOCOM
2009
IEEE
14 years 2 months ago
2009
IEEE
Abstract—In large-scale peer-to-peer (P2P) live streaming systems with a limited supply of server bandwidth, increasing the amount of upload bandwidth supplied by peers becomes c...