GAGA (GA for General Application) is a self-contained, re-entrant procedure which is suitable for the minimization of many "difficult" cost functions. Originally written in Pascal by Ian Poole, it was rewritten in C by Jon Crowcroft. GAGA can be obtained by request from the author: Jon Crowcroft <jon@cs.ucl.ac.uk>, Univeristy College London, Gower Street, London WCIE 6BT, UK, or by FTP from ftp://ftp://cs.ucl.ac.uk/darpa/gaga.shar
Mistakes in this page?
Hitch Hiker's Guide to Evolutionary Computation,
Issue 6.4, released 21 December 1998
Copyright © 1993-1998 by J. Heitkötter and
D. Beasley, all rights reserved.