Cargando…
Solving the 0/1 Knapsack Problem by a Biomolecular DNA Computer
Solving some mathematical problems such as NP-complete problems by conventional silicon-based computers is problematic and takes so long time. DNA computing is an alternative method of computing which uses DNA molecules for computing purposes. DNA computers have massive degrees of parallel processin...
Autores principales: | Taghipour, Hassan, Rezaei, Mahdi, Esmaili, Heydar Ali |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Hindawi Publishing Corporation
2013
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3588402/ https://www.ncbi.nlm.nih.gov/pubmed/23509451 http://dx.doi.org/10.1155/2013/341419 |
Ejemplares similares
-
How Humans Solve Complex Problems: The Case of the Knapsack Problem
por: Murawski, Carsten, et al.
Publicado: (2016) -
Knapsack problems
por: Kellerer, Hans, et al.
Publicado: (2004) -
An efficient optimizer for the 0/1 knapsack problem using group counseling
por: Ghadi, Yazeed Yasin, et al.
Publicado: (2023) -
Binary salp swarm algorithm for discounted {0-1} knapsack problem
por: Dang, Binh Thanh, et al.
Publicado: (2022) -
Fast Polynomial Time Approximate Solution for 0-1 Knapsack Problem
por: Wang, Zhengyuan, et al.
Publicado: (2022)