Generic DNA encoding design scheme to solve combinatorial problems
Combinatorial problems arise in many areas of computer science and application domains. It involves finding groupings, ordering, or assignment of a discrete; finite set of objects that satisfy given conditions. The complexity of combinatorial problems is classified as NP meaning that algorithms are...
Saved in:
| 主要作者: | |
|---|---|
| 格式: | Thesis |
| 语言: | English |
| 出版: |
2015
|
| 主题: | |
| 在线阅读: | http://umpir.ump.edu.my/id/eprint/17669/16/Generic%20DNA%20encoding%20design%20scheme%20to%20solve%20combinatorial%20problems.pdf |
| 标签: |
添加标签
没有标签, 成为第一个标记此记录!
|