Author:
Beasley David,Paredis Jan,Palmer Charles,Kershenbaum Aaron,Iba Hitoshi,Nordin Peter,Mitchell Melanie,Crutchfield James,Das Rajarshi,David Schaffer J,Karr C,Petry Frederick,Buckles Bill,Kraft Donald,Prabhu Devaraya,Sadasivan Thyagarajan,Willett Peter,Janikow Cezary,Oakley E Howard,Fogarty Terence,Smith Robert,Dike Bruce,Schultz Alan,Grefenstette John,De Jong Kenneth,Varanelli J,Cohoon James,Martin W
Reference407 articles.
1. Beasley D, Bull D R and Martin R R 1993 Reducing epistasis in combinatorial problems by expansive coding Proc. 5th Int. Conf. on Genetic Algorithms ed S Forrest (San Mateo, CA: Morgan Kaufmann)pp400-407
2. Cramer N L 1985 A representation for the adaptive generation of simple sequential programs Proc. 1st Int. Conf. on Genetic Algorithms ed J J Grefenstette (Erlbaum)pp183-187
3. De Jong K and Spears W M 1989 Using genetic algorithms to solve NP-complete problems Proc. 3rd Int. Conf. on Genetic Algorithms ed J D Schaffer (San Mateo, CA: Morgan Kaufmann)pp124-132