Zobrazeno 1 - 10
of 19
pro vyhledávání: '"Alec Henderson"'
Autor:
Viet Long Bui, Angus E. Hughes, Romain Ragonnet, Michael T. Meehan, Alec Henderson, Emma S. McBryde, James M. Trauer
Publikováno v:
BMC Infectious Diseases, Vol 24, Iss 1, Pp 1-11 (2024)
Abstract Background Traditional epidemiological models tend to oversimplify the transmission dynamics of Mycobacterium tuberculosis (M.tb) to replicate observed tuberculosis (TB) epidemic patterns. This has led to growing interest in advanced methodo
Externí odkaz:
https://doaj.org/article/1f19ab1fbb774cbc9b8608f28ac3ec79
Publikováno v:
Computer Science Journal of Moldova, Vol 29, Iss 1(85), Pp 3-28 (2021)
Sudoku is known as a NP-complete combinatorial number-placement puzzle. In this study, we propose the first cP~system solution to generalised Sudoku puzzles with $m \times m$ cells grouped in $m$ blocks. By using a fixed constant number of rules, our
Externí odkaz:
https://doaj.org/article/b0cfe43d5a25466a81856a3620e594da
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:
Journal of Membrane Computing. 5:25-54
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
Publikováno v:
Theoretical Computer Science. 958: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
Publikováno v:
Journal of Membrane Computing. 2:121-136
We introduce water tank systems as a new class of membrane systems inspired by a decentrally controlled circulation of water or other liquids throughout cells called tanks and capillaries called pipes. To our best knowledge, this is the first proposa
Autor:
Alec Henderson, Radu Nicolescu
Publikováno v:
Membrane Computing ISBN: 9783030127961
Int. Conf. on Membrane Computing
Int. Conf. on Membrane Computing
We propose a new version of our cP systems, extended to match the Actor model, thereby solving an earlier open problem. In the new version, top-cells have control upon the input message flow, to decide which message types are acceptable and at what t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1503c6bc0249379e2507aafa0f4d87af
https://doi.org/10.1007/978-3-030-12797-8_12
https://doi.org/10.1007/978-3-030-12797-8_12
Autor:
Radu Nicolescu, Alec Henderson
Publikováno v:
Enjoying Natural Computing ISBN: 9783030002640
Enjoying Natural Computing
Enjoying Natural Computing
We overview the current state of cP systems and illustrate it with a series of old and new examples, intentionally simple, but fundamental in their areas. cP systems – i.e. P systems with compound terms – share the fundamental features of traditi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e51c76e35a0a08b5cbc33f953b7b2270
https://doi.org/10.1007/978-3-030-00265-7_17
https://doi.org/10.1007/978-3-030-00265-7_17