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:
Main Author: | Rofilde, Hasudungan |
---|---|
Format: | Thesis |
Language: | English |
Published: |
2015
|
Subjects: | |
Online Access: | http://umpir.ump.edu.my/id/eprint/17669/16/Generic%20DNA%20encoding%20design%20scheme%20to%20solve%20combinatorial%20problems.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
An enhanced gated recurrent unit with auto-encoder for solving text classification problems
by: Zulqarnain, Muhammad
Published: (2020) -
Design Of Perturbative Hyper-Heuristics For Combinatorial Optimisation
by: Choong, Shin Siang
Published: (2019) -
An Enhanced Distribution Transforming Encoder (Dte) Of The Honey Encryption Scheme For Reinforcing Text-Based Encryption
by: Omolara, Abiodun Esther
Published: (2020) -
Newton based homotopy optimization method for solving global optimization problem
by: Mohd. Taha, Ahmad Zharif Salami
Published: (2013) -
Simulated annealing approach in solving the minimax problem with fixed line barrier
by: Tuan Mahmud, Tuan Mariam
Published: (2013)