Ponencia
Asynchronous P Systems (Draft)
Autor/es | Balanescu, Tudor
Nicolescu, Radu Wu, Huiling |
Fecha de publicación | 2011 |
Fecha de depósito | 2016-04-04 |
Publicado en |
|
ISBN/ISSN | 9788461518371 |
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 ... 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. |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
01Async_P_Systems.pdf | 373.4Kb | ![]() | Ver/ | |