Buscar
Mostrando ítems 1-2 de 2
Ponencia
Asynchronous P Systems (Draft)
(Fénix Editora, 2011)
In this paper, we propose a new approach to fully asynchronous P systems, and a matching complexity measure, both inspired from the eld of distributed algorithms. We validate our approach by implementing several well-known ...
Ponencia
BFS Solution for Disjoint Paths in P Systems
(Fénix Editora, 2011)
This paper continues the research on determining a maximum cardinality set of edge- and node-disjoint paths between a source cell and a target cell in P systems. We review the previous solution, based on depth-fi rst ...