Why is problem-dependent and high-level representation scheme better in a genetic algorithm?
Sam Chung, Rafael Pérez · 1997
Article Free Access Share on Why is problem-dependent and high-level representation scheme better in a genetic algorithm? Authors: Sam Chung Regenstrief Institute for Health Care, Indiana University Medical Center, 1001 West 10th St., Indianapolis, IN Regenstrief Institute for Health Care, Indiana University Medical Center, 1001 West 10th St., Indianapolis, INView Profile , Rafael Perez Dept. of Computer Science & Engineering, University of South Florida, 4202 East Fowler Ave., ENB 118, Tampa, FL Dept. of Computer Science & Engineering, University of South Florida, 4202 East Fowler Ave., ENB 118, Tampa, FLView Profile Authors Info & Claims SAC '97: Proceedings of the 1997 ACM symposium on Applied computingApril 1997 Pages 239–246https://doi.org/10.1145/331697.331747Published:01 April 1997Publication History 1citation461DownloadsMetricsTotal Citations1Total Downloads461Last 12 Months3Last 6 weeks1 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF