Automatically discovering solutions that flexibly combine iterative and non-iterative computations [microform]
- Bib ID:
- 3283802
- Format:
- Book and Microform
- Author:
- Handley, Simon Graham
- Description:
- 490 p.
- ISBN:
- 0591908468
- Summary:
-
This thesis investigates computational techniques that automatically discover solutions to problems. In particular, this thesis focuses on the discovery of solutions that flexibly combine iterative and non-iterative computations. Consider, for example, the problem of assigning poker hands to classes (such as full-house or two-pairs). This classification is a mapping
These techniques automatically discover solutions that combine iterative and non-iterative computations with varying degrees of flexibility. All four techniques are based on genetic programming, an evolutionary algorithm. The appropriate criteria for analyzing these techniques are discussed. One important design criterion is the degree to which representational flexibility is traded-off for run-time predictability. This trade-off is observed in many solution discovery techniques: solutions that are drawn from a search space with a high degree of representational freedom often have execution times that are difficult to predict. The techniques are demonstrated on the following problems: computing parity, classifying poker hands, generating hypotheses about coiled-coil regions, recognizing splice sites, parsing genes, recognizing E. coli promoters, secondary structure prediction, and predicting the degree of exposure to solvent of amino acid residues.
By examining the problems that worked, and those that did not, we gained an understanding of (a) why these techniques work, (b) the types of problems on which they work, and (c) the types of problems on which they don't work.
- Notes:
-
- (UnM)AAI9837102
- Source: Dissertation Abstracts International, Volume: 59-06, Section: B, page: 2847.
- Advisers: John R. Koza; Russ B. Altman.
- Thesis (Ph.D.)--Stanford University, 1998.
- Reproduction:
- Microfiche. Ann Arbor, Mich.: University Microfilms International.
- Subject:
- Computer Science
- Other authors/contributors:
- Stanford University
- Copyright:
-
In Copyright
Contact us for information about copying.
Copyright status was determined using the following information:
- Material type:
- Literary Dramatic Musical
- Published status:
- Unpublished
- Creation date:
- 1998
Copyright status may not be correct if data in the record is incomplete or inaccurate. Other access conditions may also apply. For more information please see: Copyright in library collections.
Request this item
Request this item to view in the Library’s reading room.
Feedback
Similar items
- Rescheduling nwith iterative repair [microform] / Monte Zweben ... [et al.]
- Iterative functional equations / Marek Kuczma, Bogdan Choczewski, Roman Ger
- Non iterative automatic equalization / by A. Cantoni [and] P. Butler
- Iterative solution of large linear systems [by] David M. Young
- Optimal application of Morrison's iterative noise removal for deconvolution [microform]