Genetic Algorithms and the Search for Viable String VacuaCan genetic algorithms find heterotic string vacua satisfying several discrete phenomenological requirements substantially faster than randomized searches, and can their convergence provide indirect information about structure in the encoded landscape?
Source ID: unit:dc5d5bb1ea6e6bdf18708808d361917dc635ccb7f88c5c9a8cf6f35a39b1a603
Archived source locator: {"paperId":"1404.7359","sourceSha256":"d1b077d2a310fc11d9004d28fbbf3fed0fa06e9ba6ebad1095bd1c287a3a53c8","pages":[3,18],"evidenceRefs":["source-graph:ev:12b9cf5407d340dd1fab1e66266f8ec3","source-graph:ev:374043fd7967580ac3dd43d2c06030fe"]}
Optional complete source context (gzip JSON). Exact source-object relations retain their own scope; they do not imply relations between entire topics.