Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Sientang Tsai"'
Publikováno v:
Computer Science and Information Technology. 2:281-286
In this paper, it demonstrates how to use a sticker-based model to design a simple DNA-based algorithm for solving the clique problem. We first construct the solution space of memory complexes for the clique problem via the sticker-based model. Then,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bd0aac28923f90cf90c9966544243d7c
https://doi.org/10.13189/csit.2014.020603
https://doi.org/10.13189/csit.2014.020603
Autor:
Sientang Tsai, Wei-Yeh Chen
Publikováno v:
International Journal of Computer Science and Information Technology. 5:21-37
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9896d9721a0fc913f2c0aaed709127a7
https://doi.org/10.5121/ijcsit.2013.5602
https://doi.org/10.5121/ijcsit.2013.5602
Autor:
Sientang Tsai
Publikováno v:
Computer Science and Information Technology. 1:243-251
It is shown first by Adleman that deoxyribonucleic acid (DNA) strands could be employed towards calculating solution to an instance of The NP-complete Hamiltonian Path Problem (HPP). Lipton also demonstrated that Adleman's techniques could be used to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::603a4c8413c4e6b2c37bdf1bb8e0ae13
https://doi.org/10.13189/csit.2013.010402
https://doi.org/10.13189/csit.2013.010402
Autor:
Sientang Tsai
Publikováno v:
Computer Science and Information Technology. 1:90-96
It is shown first by Adleman that deoxyribonucleic acid (DNA) strands could be employed towards calculating solution to an instance of the NP-complete Hamiltonian Path Problem (HPP). Lipton also demonstrated that Adleman's techniques could be used to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d9c1cf45f41594b0b15c994a14b3bd7f
https://doi.org/10.13189/csit.2013.010203
https://doi.org/10.13189/csit.2013.010203
Autor:
Sientang Tsai
Publikováno v:
Algorithms and Architectures for Parallel Processing ISBN: 9783642030949
ICA3PP
ICA3PP
It is shown first by Adleman that deoxyribonucleic acid (DNA) strand could be employed towards calculating solution to an instance of the NP-complete Hamiltonian Path Problem (HPP). Lipton also demonstrated that Adleman's techniques could be used to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5fb3d7f92732887f8b4cb2b80929ea2f
https://doi.org/10.1007/978-3-642-03095-6_40
https://doi.org/10.1007/978-3-642-03095-6_40
Autor:
Sientang Tsai
Publikováno v:
2008 Third International Conference on Convergence and Hybrid Information Technology.
In this paper, it demonstrates how to use a sticker-based model to design a simple DNA-based algorithm for solving the clique problem. We first construct the solution space of memory complexes for the clique problem via the sticker-based model. Then,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::61e534dc86a1dbe5c302aa9b12e1d2cf
https://doi.org/10.1109/iccit.2008.264
https://doi.org/10.1109/iccit.2008.264
Publikováno v:
IEEE Congress on Evolutionary Computation
Suppose that a finite set S has q elements, and each element in S is a positive integer. The set-partition problem is to determine whether there is a subset TsubeS such that SigmaxisinT x=SigmaxisinTmacr x, where Tmacr={x|xisinS and xnotinT}. This pa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2b962f3f573c4dfcf53f50827d583e40
https://doi.org/10.1109/cec.2008.4631137
https://doi.org/10.1109/cec.2008.4631137
Publikováno v:
2007 International Conference on Convergence Information Technology (ICCIT 2007).
It is shown first by Adleman that deoxyribonucleic acid (DNA) strands could be employed towards calculating solution to an instance of the NP-complete Hamiltonian path problem (HPP). Lipton also demonstrated that Adleman's techniques could be used to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::80694f62de8951d4afb2f0bec4f5af07
https://doi.org/10.1109/iccit.2007.155
https://doi.org/10.1109/iccit.2007.155
Publikováno v:
2007 International Conference on Convergence Information Technology (ICCIT 2007).
This paper presents an algorithm for retrieving the stem volume of forest stands on relatively flat ground. A forest backscatter model at the individual tree level is used to derive the algorithm. This model treats the trunk volumes as random quantit
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c11f6ed5708c159c494f2f09dcbd9a8a
https://doi.org/10.1109/iccit.2007.93
https://doi.org/10.1109/iccit.2007.93