Back to Results
First PageMeta Content



Two Ways of Discovering the Size and Shape of a Computer Program to Solve a Problem John R. Koza Computer Science Department Stanford University
Add to Reading List

Document Date: 2006-11-17 21:17:58

Open Document

File Size: 201,12 KB

Share Result on Facebook

City

Tokyo / Ann Arbor / San Mateo / Pollack / Cambridge / City / San Diego / New York / /

Company

IBM / The MIT Press / Bickel A. S. / E Average Size S A / Pattern-Directed Inference Systems / John Wiley & Sons / /

Country

Netherlands / /

/

Facility

University of Michigan Press / University of Idaho / /

IndustryTerm

ultimate solution / genetic algorithm / adaptive algorithms / genetic algorithms / evolutionary algorithms / search space / /

OperatingSystem

Microsoft Windows / /

Organization

University of Idaho / Stanford University Computer Science Department / University of Michigan Press / MIT / Stanford University / Stanford University Stanford / /

Person

Susumu Ohno / David Andre / Cory Fujiki / John R. Koza / Brooks Low / Walter Alden Tackett / John Holland / J. Doyne / Steven F. Smith / Lawrence Erlbaum / Kenneth E. Jr / Charles Darwin / Morgan Kaufmann / /

/

Position

editor / Farmer / /

ProgrammingLanguage

C / /

ProvinceOrState

Idaho / /

PublishedMedium

Cavalier / Journal of Molecular Biology / Complex Systems / /

Technology

Messy genetic algorithms / expert system / radiation / RAM / artificial intelligence / genetic algorithm / Hierarchical genetic algorithms / machine learning / Smith-Waterman algorithm / recombination / aligned using the Smith-Waterman algorithm / /

URL

http /

SocialTag