Sciweavers

6978 search results - page 175 / 1396
» On Proofs in System P
Sort
View
IJFCS
2007
100views more  IJFCS 2007»
15 years 6 months ago
On the Power of Deterministic and Sequential Communicating P Systems
We characterize the computational power of several restricted variants of communicating P systems. We show that 2-deterministic communicating P systems with 2 membranes, working in...
Ludek Cienciala, Lucie Ciencialová, Pierlui...
UC
2005
Springer
15 years 12 months ago
On Model-Checking of P Systems
Abstract. Membrane computing is a branch of molecular computing that aims to develop models and paradigms that are biologically motivated. It identifies an unconventional computin...
Zhe Dang, Oscar H. Ibarra, Cheng Li, Gaoyan Xie
FLAIRS
1998
15 years 7 months ago
Propagating Probabilities in System P
In this paper wesuggest a wayof using the rules of System P to propagate lower bounds on conditional probabilities. Usinga knowledgebase of default rules whichart, consideredto be...
Rachel A. Bourne, Simon Parsons
MEMBRANE
2004
Springer
15 years 12 months ago
Inhibiting/De-inhibiting Rules in P Systems
We introduce in the P systems area a mechanism, inspired from neural-cell behavior, which controls computations by inhibiting and de-inhibiting evolution rules. We investigate the ...
Matteo Cavaliere, Mihai Ionescu, Tseren-Onolt Ishd...
TCC
2009
Springer
141views Cryptology» more  TCC 2009»
16 years 7 months ago
Proofs of Retrievability via Hardness Amplification
Proofs of Retrievability (PoR), introduced by Juels and Kaliski [JK07], allow the client to store a file F on an untrusted server, and later run an efficient audit protocol in whi...
Yevgeniy Dodis, Salil P. Vadhan, Daniel Wichs