Opened Access Asynchronous P Systems (Draft)
Estadísticas
Icon
Exportar a
Autor: Balanescu, Tudor
Nicolescu, Radu
Wu, Huiling
Fecha: 2011
Publicado en: 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
Tipo de documento: Ponencia
Resumen: 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.
Tamaño: 373.4Kb
Formato: PDF

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

Mostrar el registro completo del ítem


Esta obra está bajo una Licencia Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 Internacional

Este registro aparece en las siguientes colecciones