Crossref
Using Parallel Filtering Algorithms to Solve the 0-1 Knapsack Problem on DNA-based Computing
Computer Science and Information Technology · 2013
DOI: 10.13189/csit.2013.010203 ↗Kurz gefasst
Fachartikel in der Zeitschrift Computer Science and Information Technology, 2013. Verfasst von Sientang Tsai.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Zitieren
APA
Tsai, S. (2013). Using Parallel Filtering Algorithms to Solve the 0-1 Knapsack Problem on DNA-based Computing. Computer Science and Information Technology. https://doi.org/10.13189/csit.2013.010203
Vancouver
Tsai S. Using Parallel Filtering Algorithms to Solve the 0-1 Knapsack Problem on DNA-based Computing. Computer Science and Information Technology. 2013. doi:10.13189/csit.2013.010203
BibTeX
@article{Tsai2013,
author = {Tsai, Sientang},
title = {Using Parallel Filtering Algorithms to Solve the 0-1 Knapsack Problem on DNA-based Computing},
journal = {Computer Science and Information Technology},
year = {2013},
doi = {10.13189/csit.2013.010203}
}
EUVIMED