Zobrazeno 1 - 10
of 81
pro vyhledávání: '"Michael J. Dinneen"'
Publikováno v:
Axioms, Vol 11, Iss 2, p 66 (2022)
P systems have been known to provide efficient polynomial (often linear) deterministic solutions to hard problems. In particular, cP systems have been shown to provide very crisp and efficient solutions to such problems, which are typically linear wi
Externí odkaz:
https://doaj.org/article/31012c16f48f489ebd8b4e740707e1c5
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 273, Iss Proc. PC 2018, Pp 1-13 (2018)
Quantum annealing has shown significant potential as an approach to near-term quantum computing. Despite promising progress towards obtaining a quantum speedup, quantum annealers are limited by the need to embed problem instances within the (often hi
Externí odkaz:
https://doaj.org/article/49c6d41cce704a2eb6690095e0fe0808
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 40, Iss Proc. MeCBIC 2010, Pp 121-141 (2010)
In this paper, we continue our development of algorithms used for topological network discovery. We present native P system versions of two fundamental problems in graph theory: finding the maximum number of edge- and node-disjoint paths between a so
Externí odkaz:
https://doaj.org/article/3682f6ce5ff349bf9cee172c147223a4
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 11, Iss Proc. MeCBIC 2009, Pp 107-122 (2009)
We propose two uniform solutions to an open question: the Firing Squad Synchronization Problem (FSSP), for hyperdag and symmetric neural P systems, with anonymous cells. Our solutions take e_c+5 and 6e_c+7 steps, respectively, where e_c is the eccent
Externí odkaz:
https://doaj.org/article/61959469eff64c809f783a8a5eda8372
Publikováno v:
Journal of Membrane Computing. 5:25-54
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::909d80d8448d90b60cab8d86b53c1c78
https://doi.org/10.1007/s41965-022-00114-5
https://doi.org/10.1007/s41965-022-00114-5
Publikováno v:
Journal of Membrane Computing. 3:182-193
We further develop water computing as a variant of P systems. We propose an improved modular design, which duplicates the main water flows by associated control flows. We first solve the three open problems of the previous design by demonstrating: ho
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1bd52c00b9ec71c3bbea4d5152c1fa3d
https://doi.org/10.1007/s41965-021-00081-3
https://doi.org/10.1007/s41965-021-00081-3
Publikováno v:
Theoretical Computer Science. 958:113848
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::30a3390074432cbc60a3f160124a4f34
https://doi.org/10.1016/j.tcs.2023.113848
https://doi.org/10.1016/j.tcs.2023.113848
Publikováno v:
Journal of Membrane Computing. 2:311-322
There have been a few NP-hard problems solved using cP systems including the travelling salesman problem. However, these problems are typically in NP rather than higher in the polynomial time hierarchy. In this paper, we solve QSAT (also known as TQB
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a363daa1b812afef2bc77922c637d118
https://doi.org/10.1007/s41965-020-00064-w
https://doi.org/10.1007/s41965-020-00064-w
Publikováno v:
Journal of Membrane Computing. 2:26-41
In this paper, we present, for the first time, quantum annealing solutions for densest k-subgraph problems which have many applications in computational biology. Our solutions are formulated as solutions for quadratic unconstrained binary optimizatio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::99225b67025ea483c16b632fbc8c93a7
https://doi.org/10.1007/s41965-019-00030-1
https://doi.org/10.1007/s41965-019-00030-1
Phylogenetic (evolutionary) trees and networks are leaf-labeled graphs that are widely used to represent the evolutionary relationships between entities such as species, languages, cancer cells, and viruses. To reconstruct and analyze phylogenetic ne
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a9123f3584fa625e3fabedc35121c1de
http://arxiv.org/abs/2202.11234
http://arxiv.org/abs/2202.11234
