Opened Access Asynchronous P Systems (Draft)
Cites
Show item statistics
Icon
Export to
Author: Balanescu, Tudor
Nicolescu, Radu
Wu, Huiling
Date: 2011
Published in: Proceedings of the Ninth Brainstorming Week on Membrane Computing, 1-22. Sevilla, E.T.S. de Ingeniería Informática, 31 de enero-4 de febrero, 2011
ISBN/ISSN: 9788461518371
Document type: Presentation
Abstract: 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 distributed depth- first search (DFS) and breadth- rst search (BFS) algorithms. Empirical results show that our P algorithms achieve a performance comparable to the standard versions.
Size: 373.4Kb
Format: PDF

URI: http://hdl.handle.net/11441/39384

This work is under a Creative Commons License: 
Attribution-NonCommercial-NoDerivatives 4.0 Internacional

This item appears in the following Collection(s)