Some initial results on the study of conformon-P systems with negative values are reported. One model of these conformon-P systems is proved to be computationally universal while a...
We proved that two classes of Communicative P systems with 3 membranes and with minimal cooperation, namely P systems with symport/antiport rules of size 1 and and P systems with s...
Artiom Alhazov, Maurice Margenstern, Vladimir Rogo...
Abstract. We present PlanetP, a peer-to-peer (P2P) content search and retrieval infrastructure targeting communities wishing to share large sets of text documents. P2P computing is...
Francisco Matias Cuenca-Acuna, Christopher Peery, ...
We continue the investigation of P coloniesintroduced in [7], of abstract computing devices composed of independent agents, acting and evolving in a shared environment. We determin...
We present a polynomial time approximation algorithm for unit time precedence constrained scheduling. Our algorithm guarantees schedules which are at most 2 - 7 3p+1 factor as lon...