Mostrar el registro sencillo del ítem
Ponencia
Asynchronous P Systems (Draft)
dc.creator | Balanescu, Tudor | es |
dc.creator | Nicolescu, Radu | es |
dc.creator | Wu, Huiling | es |
dc.date.accessioned | 2016-04-04T07:58:14Z | |
dc.date.available | 2016-04-04T07:58:14Z | |
dc.date.issued | 2011 | |
dc.identifier.isbn | 9788461518371 | es |
dc.identifier.uri | http://hdl.handle.net/11441/39384 | |
dc.description.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. | es |
dc.format | application/pdf | es |
dc.language.iso | eng | es |
dc.publisher | Fénix Editora | es |
dc.relation.ispartof | 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 | es |
dc.rights | Attribution-NonCommercial-NoDerivatives 4.0 Internacional | * |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/4.0/ | * |
dc.subject | P systems | es |
dc.subject | synchronous | es |
dc.subject | asynchronous | es |
dc.subject | distributed | es |
dc.subject | depth- rst search | es |
dc.subject | breadth- rst search | es |
dc.title | Asynchronous P Systems (Draft) | es |
dc.type | info:eu-repo/semantics/conferenceObject | es |
dc.type.version | info:eu-repo/semantics/publishedVersion | es |
dc.rights.accessRights | info:eu-repo/semantics/openAccess | |
dc.identifier.idus | https://idus.us.es/xmlui/handle/11441/39384 |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
01Async_P_Systems.pdf | 373.4Kb | [PDF] | Ver/ | |