Please use this identifier to cite or link to this item:
http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/5942Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.creator | Blumberg, Andrew Justin | - |
| dc.date | 2004-10-04T14:15:46Z | - |
| dc.date | 2004-10-04T14:15:46Z | - |
| dc.date | 1996-12-01 | - |
| dc.date.accessioned | 2013-10-09T02:42:04Z | - |
| dc.date.available | 2013-10-09T02:42:04Z | - |
| dc.date.issued | 2013-10-09 | - |
| dc.identifier | AIM-1588 | - |
| dc.identifier | http://hdl.handle.net/1721.1/5942 | - |
| dc.identifier.uri | http://koha.mediu.edu.my:8181/xmlui/handle/1721 | - |
| dc.description | In this paper I present a new model that employs a biological (specifically DNA -based) substrate for performing computation. Specifically, I describe strategies for performing parallel function application in the DNA-computing models described by Adelman, Cai et. al., and Liu et. al. Employing only DNA operations which can presently be performed, I discuss some direct algorithms for computing a variety of useful mathematical functions on DNA, culminating in an algorithm for minimizing an arbitrary continuous function. In addition, computing genetic algorithms on a DNA substrate is briefly discussed. | - |
| dc.format | 14 p. | - |
| dc.format | 265794 bytes | - |
| dc.format | 210981 bytes | - |
| dc.format | application/postscript | - |
| dc.format | application/pdf | - |
| dc.language | en_US | - |
| dc.relation | AIM-1588 | - |
| dc.subject | AI | - |
| dc.subject | MIT | - |
| dc.subject | Artificial Intelligence | - |
| dc.subject | DNA Computing | - |
| dc.subject | Parallel Architecture | - |
| dc.title | Parallel Function Application on a DNA Substrate | - |
| Appears in Collections: | MIT Items | |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
