| Document Date: 2012-11-20 05:08:29
Open Document File Size: 1,04 MBShare Result on Facebook
City Sunderland / Dordrecht / New York / Oxford / Cambridge / Reading / London / / Company Gould / Fleming / Yale Univ Press / Oxford Univ Press / MIT Press / GE / Sinauer Associates / / Country Netherlands / / / Facility Princeton University / SE Model Building / Weizmann Institute of Science / / IndustryTerm nearby solutions / simulated-annealing optimization algorithms / hill-climbing algorithm / fittest network / closest solution / digital electronics / neural networks / yielded networks / feed-forward neural networks / artificial systems / integrate-and-fire neural networks / optimization algorithms / closest solutions / evolvable and modular solutions / model systems / genetic algorithms / power law / evolved networks / precise algorithm / random networks / / Organization MIT / Yale / Princeton University / Kahn Family Foundation / National Academy of Sciences / Weizmann Institute of Science / / Person Combinatorial Logic Circuits / Uri Alon / Anne Arbor / Curtis G. Callan / Jr. / Combinatorial Logic Circuits Composed / Elad Noor / Nadav Kashtan / Combinatorial Logic / Several Gate Types / / Position Pennock RT / Author / Model / Feed-forward / mutation probability Pm / F. Feed-Forward / / ProvinceOrState New Jersey / Oregon / New York / Michigan / / PublishedMedium Machine Learning / Complex Systems / Lecture Notes in Computer Science / / Technology Biotechnology / precise algorithm / Machine Learning / hill-climbing algorithm / Neural Network / simulated-annealing optimization algorithms / optimization algorithms / simulation / genotype / recombination / / URL www.tbi.univie.ac.at/RNA / www.pnas.org兾cgi兾doi兾10.1073兾pnas.0611630104 / www.pnas.org/cgi/content/full / / |
Varying environments can speed up evolution Nadav Kashtan, Elad Noor, and Uri Alon* Deptartment of Molecular Cell Biology and Physics of Complex Systems, Weizmann Institute of Science, Rehovot 76100, Israel Edited by Cur