Open Access. Powered by Scholars. Published by Universities.®

Physical Sciences and Mathematics Commons

Open Access. Powered by Scholars. Published by Universities.®

Articles 1 - 4 of 4

Full-Text Articles in Physical Sciences and Mathematics

Discovery Learning In Autonomous Agents Using Genetic Algorithms, Edward O. Gordon Dec 1993

Discovery Learning In Autonomous Agents Using Genetic Algorithms, Edward O. Gordon

Theses and Dissertations

As the new Distributed Interactive Simulation (DIS) draft standard evolves into a useful document and distributed simulations begin to emerge that implement parts of the standard, there is renewed interest in available methods to effectively control autonomous aircraft agents in such a simulated environment. This investigation examines the use of a genetics-based classifier system for agent control. These are robust learning systems that use the adaptive search mechanisms of genetic algorithms to guide the learning system in forming new concepts (decision rules) about its environment. By allowing the rule base to evolve, it adapts agent behavior to environmental changes. Addressed …


Genetic Algorithms And Their Application To The Protein Folding Problem, Donald J. Brinkman Dec 1993

Genetic Algorithms And Their Application To The Protein Folding Problem, Donald J. Brinkman

Theses and Dissertations

The protein folding problem involves the prediction of the secondary and tertiary structure of a molecule given the primary structure. The primary structure defines sequence of amino-acid residues, while the secondary structure describes the local 3-dimensional arrangement of amino-acid residues within the molecule. The relative orientation of the secondary structural motifs, namely the tertiary structure, defines the shape of the entire biomolecule. The exact, mechanism by which a sequence of amino acids protein folds into its 3- dimensional conformation is unknown Current approaches to the protein folding problem include calculus-based methods, systematic search, model building and symbolic methods, random methods …


Genetic Algorithms For Soft Decision Decoding Of Linear Block Codes, Harpal Maini, Kishan Mehrotra, Chilukuri K. Mohan, Sanjay Ranka Nov 1993

Genetic Algorithms For Soft Decision Decoding Of Linear Block Codes, Harpal Maini, Kishan Mehrotra, Chilukuri K. Mohan, Sanjay Ranka

Electrical Engineering and Computer Science - Technical Reports

Soft-decision decoding is an NP-hard problem of great interest to developers of communication systems. We show that this problem is equivalent to the problem of optimizing Walsh polynomials. We present genetic algorithms for soft-decision decoding of binary linear block codes and compare the performance with various other decoding algorithms. Simulation results show that our algorithms achieve bit-error-probabilities as low as 0.00183 for a [104, 52] code with a low signal-to-noise ratio of 2.5 dB, exploring only 30,000 codewords, whereas the search space contains 4.5 x 1015 codewords. We define a new crossover operator that exploits domain-specific information and compare it …


Revisiting The Edge Of Chaos: Evolving Cellular Automata To Perform Computations, Melanie Mitchell, Peter T. Hraber, James P. Crutchfield Jan 1993

Revisiting The Edge Of Chaos: Evolving Cellular Automata To Perform Computations, Melanie Mitchell, Peter T. Hraber, James P. Crutchfield

Computer Science Faculty Publications and Presentations

No abstract provided.