Show simple item record

dc.contributor.advisorHamerly, Gregory James, 1977-
dc.contributor.authorEwert, Winston.
dc.contributor.otherBaylor University. Dept. of Computer Science.en
dc.date.accessioned2011-01-05T19:38:32Z
dc.date.available2011-01-05T19:38:32Z
dc.date.copyright2010-12
dc.date.issued2010
dc.identifier.citationEwert, Winston, William A. Dembski, and Robert J. Marks II. "Evolutionary Synthesis of Nand Logic : Dissecting a Digital Organism." Proceedings 2009 International Conference on Systems, Man and Cybernetics October 11-14, 2009 : San Antonio, Texas, USA. [Piscataway, N.J.]: IEEE, 2009. 3047-3053.en
dc.identifier.citationEwert, Winston, George Montañez, William A. Dembski, and Robert J. Marks II. "Efficient Per Query Information Extraction from a Hamming Oracle." Proceedings of the 42nd Meeting of the Southeastern Symposium on System Theory. University of Texas at Tyler, Tyler, TX. 2010. 290-297.en
dc.identifier.urihttp://hdl.handle.net/2104/8080
dc.descriptionIncludes bibliographical references (p. ).en
dc.description.abstractA search process is an attempt to locate a solution to a problem, such as an optimization problem, where the space is usually too large to exhaustively sample. In order to investigate this idea this work looks a three examples of searches as cases studies. The examples considered are the location of a hidden string using a hamming distance, the encoding of a binary string using a perceptron, and developing programs using nand gates. In all of these cases, it is shown that the search processes work by making use of problem specific information. In addition, the algorithms used to demonstrate these search processes are often relatively inefficient at extracting the information from the available knowledge sources.en
dc.description.statementofresponsibilityby Winston Ewert.en
dc.format.extent3056844 bytes
dc.format.extent93327 bytes
dc.format.extent90875 bytes
dc.format.extent4012197 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/pdf
dc.language.isoen_USen
dc.rightsBaylor University theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. Contact librarywebmaster@baylor.edu for inquiries about permission.en
dc.subjectSearch.en
dc.subjectActive information.en
dc.subjectNo free lunch.en
dc.titleStudies of active information in search.en
dc.typeThesisen
dc.description.degreeM.S.en
dc.rights.accessrightsWorldwide accessen
dc.contributor.departmentComputer Science.en


Files in this item

Thumbnail
Thumbnail
Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record