Item Infomation

Full metadata record
DC FieldValueLanguage
dc.contributor.authorJosé Angel Sanchez, Martín-
dc.contributor.authorVictor, Mitrana-
dc.contributor.authorMihaela, Păun-
dc.date.accessioned2023-04-07T06:53:26Z-
dc.date.available2023-04-07T06:53:26Z-
dc.date.issued2023-
dc.identifier.urihttps://link.springer.com/article/10.1007/s41965-023-00120-1-
dc.identifier.urihttps://dlib.phenikaa-uni.edu.vn/handle/PNK/7665-
dc.descriptionCC BYvi
dc.description.abstractNetworks of splicing processors are one of the theoretical computational models that take inspiration from nature to efficiently solve problems that our current computational knowledge is not able to. One of the issues restricting/hindering is practical implementation is the arbitrariness of the underlying graph, since our computational systems usually conform to a predefined topology. We propose simulations of networks of splicing processors having arbitrary underlying graphs by networks whose underlying graphs are of a predefined topology: complete, star, and grid graphs.vi
dc.language.isoenvi
dc.publisherSpringervi
dc.subjectNetworks of splicing processorsvi
dc.titleNetworks of splicing processors: simulations between topologiesvi
dc.typeBookvi
Appears in CollectionsOER - Công nghệ thông tin

Files in This Item: