Modularity in P colonies with checking rules

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F47813059%3A19240%2F12%3A%230004403" target="_blank" >RIV/47813059:19240/12:#0004403 - isvavai.cz</a>
Result on the web
<a href="http://link.springer.com/chapter/10.1007/978-3-642-28024-5_9" target="_blank" >http://link.springer.com/chapter/10.1007/978-3-642-28024-5_9</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-642-28024-5_9" target="_blank" >10.1007/978-3-642-28024-5_9</a>

Result language
angličtina
Original language name
Modularity in P colonies with checking rules
Original language description
P colony is an abstract computing device composed of independent agents, acting and evolving in a shared environment. In this paper we bring a new view to investigation of the behavior of the P colonies. The first part of the paper focuses on the modularity of the P colonies with checking rules. We group the agents into modules with specific function. In the second part of the paper we introduce improved results concerning the computational power of the P colonies with capacity one.
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
IN - Informatics
OECD FORD branch
—

Project
<a href="/en/project/ED1.1.00%2F02.0070" target="_blank" >ED1.1.00/02.0070: IT4Innovations Centre of Excellence</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2012
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)